#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




string a;

int consistency(int n){


	unordered_set<string> st = {
	    "1",
	    "101",
	    "11001",
	    "1111101",
	    "1001110001",
	    "110000110101",
	    "11110100001001"
	};
	vector<int> dp(n+1, INF);
	dp[0] = 0;
	for(int i=1; i<=n; i++){
	    int j=i-1;
	    while(j>=0){
	        string str = a.substr(j, i-j);
	        if(st.count(str)){
	            dp[i] = min(dp[i], dp[j] + 1);
	        }
	        j--;
	    }
	}
	
	if(dp[n] == INF) return -1;
	return dp[n];

}















int practice(int n){


    return 0;
}





void solve() {
    
    int n;
    
    cin >> a;
    n = a.size();
    
    cout << consistency(n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}