#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define endl '\n'
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> pii;
typedef double db;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand()%x; }
const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod;assert(b>=0);for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
// head

signed main() {
string p; cin>>p;
	auto calc=[&](string s)->int{
		vector<pii> ls;
		int len=0;
		for (int i=0,j=0;i<SZ(s);i++) {
			if (s[i]=='1') {
				j=i; while (s[j]=='1' and j<SZ(s)) j++;
				ls.pb(mp(i,j-1));
				len+=(j-i),i=j-1;
			}
		}
		if (!len) return 0;
		int ans=len;
		for (int i=0;i<SZ(ls);i++) {
			for (int j=i;j<SZ(ls);j++) {
				int res=0,qwq=0;
				for (int pos=0;pos<SZ(ls);pos++) {
					if (pos<i or pos>j) {
						res+=(ls[pos].se-ls[pos].fi+1);
					} else qwq+=(ls[pos].se-ls[pos].fi+1);
				}
				res+=ls[j].se-ls[i].fi+1-qwq;
				// cerr<<i<<" "<<j<<" "<<res<<endl;
				ans=min(ans,res);
			}
		}
		return ans;
	};
	int ans=calc(p);
	reverse(all(p));
	ans=min(ans,calc(p));
	cout<<ans;
}