#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;
const long double PI = acos((long double)(-1));

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

int main()
{
    
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    string s; cin >> s;
    reverse(s.begin(), s.end());
    s += '0';
    bool up = false;
    int cnt = 0;
    for (int i = 0; i < s.size(); i++) {
        if (up) {
            if (s[i] == '0') s[i] = '1', up = false;
            else s[i] = '0';
        }
        if (s[i] == '1') {
            if (i + 1 < s.size() and s[i + 1] == '1') up = true, cnt++;
            else cnt++;
        }
    }
    cout << cnt << endl;
    return 0;
}