#include<bits/stdc++.h>
using namespace std;
using ll =long long ;
vector<ll>a1,a0;
ll b1[100],b0[100];
ll dp1[100][5],dp2[100][5];
int main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	string s;
	cin>>s;
	ll n=s.size();
	ll f=0;
	for(ll i=0;i<n;i++)
	{
		if(s[i]=='1')
		{
			f=1;
			ll j;
			for(j=i;j<n;j++)
			{
				if(s[j]!=s[i])
				{
					break;
				}
			}
			a1.push_back(j-i);
			i=j-1;
		}
		else if(s[i]=='0'&&f==1)
		{
			ll j;
			for(j=i;j<n;j++)
			{
				if(s[j]!=s[i])
				{
					break;
				}
				
			}
			a1.push_back(j-i);
			i=j-1;
		}
	}
	ll l1=a1.size(),ff=0,ans1=0,ans2=0,i,sum=1e9;
	a1.push_back(0);
	a1.push_back(0);
	if(l1%2==0&&l1!=0)
	{
		a1[l1-1]=0;
		l1--;
	}
	ans1=0;
	for(i=0;i<l1;i+=2) 
	{
		ll j;
		
		for(j=i;j<l1;j+=2)
		{
			dp1[j+1][0]=dp1[j-1][0]+a1[j+1];
			dp1[j+1][1]=min(dp1[j-1][1],dp1[j-1][0])+a1[j+2];
		}
		sum=min(sum,min(dp1[j-1][0],dp1[j-1][1])+ans1);
		for(j=i;j<l1;j+=2)
			dp1[j+1][0]=0,dp1[j+1][1]=0;
		ans1+=a1[i];
	}
	cout<<sum<<'\n';
}