#include<bits/stdc++.h>
using namespace std;using ll=long long;const int N=60;
int n,a[N];char str[N];ll ans=5e18;
ll calc(ll x){int y=__lg(x);ll s=0;for(int i=1;i<=y;i++)s+=((1ll<<i)-(1ll<<i-1))*i;s+=(x-(1ll<<y)+1)*(y+1);return s;}
ll trs(int l,int r){ll s=0;for(int i=l;i<=r;i++)s=s*2+a[i];return s;}
bool cmp(int l,int r,ll x){if(__lg(x)!=r-l)return 0;for(int i=r;i>=l;i--,x>>=1)if(i<=n&&i>=1&&(x&1)!=a[i])return 0;return 1;}
bool comp(int x,int y,int len){for(int i=0;i<len;i++)if(a[i+x]!=a[i+y])return 0;return 1;}
bool chk(int l,int r){
	ll x=trs(l,r),j;if(!x)return 0;j=x+1;for(int i=r+1;i<=n;i+=__lg(j++)+1)if(!cmp(i,i+__lg(j),j))return 0;
	j=x-1;for(int i=l-1;i>0;i-=__lg(j--)+1)if(j<=0||!cmp(i-__lg(j),i,j))return 0;return 1;
}
int main(){
	ll l=1,r=1ll<<55,mid;
	for(;l+1<r;)(calc(mid=(l+r)>>1)<=2912930?l:r)=mid;
	cerr<<l<<' '<<calc(l)<<endl;
	cin>>str+1;n=strlen(str+1);for(int i=1;i<=n;i++)a[i]=str[i]&1;
	for(int i=1;i<=n;i++)if(a[i])for(int j=i;j<=n;j++)if(chk(i,j))ans=min(ans,calc(trs(i,j))+n-j);
	for(int i=1;i<=n;i++)if(a[i])for(int j=0;j+1<i&&i+j-1<=n;j++)if(comp(1,n-j+1,j)){
		ll x=0;for(int k=i;k<=n;k++)x=x*2+a[k];bool t=1;
		for(int k=j+1;k<i;k++)x=x*2+a[k],t&=a[k];if(!t)ans=min(ans,calc(x)+n-i+1);
	}int cnt=0;for(int i=n;i>=1&&!a[i];i--)cnt++;for(int i=1;i<n&&a[i];i++)if(i>cnt&&a[i+1]){
		ll x=0;for(int j=i+1;j<=n-cnt-1;j++)x=x*2+a[j];x*=2;for(int j=1;j<=i;j++)x=x*2+1;ans=min(ans,calc(x)+n-i);
	}cout<<ans;return 0;
}