#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

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

    string s;
    cin >> s;
    reverse(begin(s), end(s));
    int n = s.length();
    vector<vector<int>> dp(n + 1, vector<int>(2, INF));
    dp[0][0] = 0;
    for(int i = 0; i < n; ++i){
        if(s[i] == '0'){
            chmin(dp[i + 1][0], min(dp[i][0], dp[i][1] + 1));
            chmin(dp[i + 1][1], dp[i][1] + 1);
        }
        else{
            chmin(dp[i + 1][0], dp[i][0] + 1);
            chmin(dp[i + 1][1], min(dp[i][0] + 1, dp[i][1]));
        }
    }
    cout << min(dp[n][0], dp[n][1] + 1) << endl;

    return 0;
}