#include<bits/stdc++.h>
using namespace std;
using ll=long long;
ll calc(ll x)
{
	ll tmp=__lg(x);
	ll ans=0;
	for(int i=1;i<=tmp;i++)
		ans+=i*(1ll<<(i-1));
	ans+=(tmp+1)*(x-(1ll<<tmp)+1);
	return ans;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	unsigned long long ans=0x3f3f3f3f3f3f3f3f;
	string s;
	cin>>s;
	// Case 1
	{
		ll tot=(s[0]=='0');
		for(auto ch:s)
			tot=(tot<<1)|(ch^48);
		ans=calc(tot);
	}
	// Case 2
	{
		for(int i=1;i<s.length();i++) if(s[i]=='1')
		{
			ll A=0,B=0;
			for(int j=0;j<i;j++)
				A=(A<<1)|(s[j]^48);
			for(int j=i;j<s.length();j++)
				B=(B<<1)|(s[j]^48);
			ll mod=(1ll<<i);
			for(int b=0;b+s.length()-i<=58;b++)
			{
				ll L=B<<b,R=(B+1)<<b;
				L--;
				R--;
				ll val=(L<=A?A:(L-A+mod-1)/mod*mod+A);
				if(s[0]=='0') val=max(val,A+mod);
				if(val<R)
					ans=min(ans,calc(val)+s.length()-i);
			}
		}
	}
	// Case 3
	{
		for(int i=0;i<s.length();i++) if(s[i]=='1')
			for(int j=i;j<s.length();j++)
			{
				ll val=0;
				for(int k=i;k<=j;k++)
					val=(val<<1)|(s[k]^48);
				string pattern;
				int len=0;
				for(ll k=val-1;k<=val+50;k++)
				{
					ll tmp=k;
					string suf;
					while(tmp)
					{
						suf+=(char)(48^(tmp&1));
						tmp>>=1;
					}
					if(k==val-1)
						len=suf.length();
					reverse(suf.begin(),suf.end());
					pattern+=suf;
				}
				if(len<i) continue;
				pattern=pattern.substr(len-i,s.length());
				if(pattern==s)
					ans=min(ans,calc(val)+s.length()-j-1);
			}
	}
	cout<<ans<<endl;
	return 0;
}