#include <iostream>
#include <vector>
#include <queue>
#include <string>
#define PB push_back
#define F first
#define B back

using namespace std;

typedef long long int ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;

int b;

queue<pair<ll, int>> q;
string s;
long long pw[50];

int main(int argc, char const *argv[]) {
  cin>>s;
  b = s.size();

  if(s[0] == '0')
  {
    cout<<-1<<endl;
    return 0;
  }

  pw[0] = 1;

  for(int i = 1; i < 50; i++)
    pw[i] = pw[i-1]*2;

  ll num = 0;

  for(int i = 0; i < b; i++)
  {
    num *= 2;
    num += s[i]-'0';
  }

  q.push({num, 0});

  while(1)
  {
    ll c = q.front().first;
    ll d = q.front().second;
    q.pop();
    if(c == pw[b]-1)
    {
      cout<<d<<endl;
      return 0;
    }
    int ones = 0;
    int cb = b-1;
    while((c/pw[cb])%2)
    {
      ones++;
      cb--;
    }
    for(int i = ones; i; i--)
    {
      if((c|(c/pw[i])) == pw[b]-1)
      {
          cout<<d+1<<endl;
          return 0;
      }
      else if(d < 5)
        q.push({c|(c/pw[i]), d+1});
    }
  }



  return 0;
}