#include<cstdio>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=5010,T=2010,H=T>>1,FSIZE=1<<18,INF=0x3f3f3f3f;
int tn,s[N];
int _f[2][T+1][T+1];
vector<pair<short,short>> p,np;
auto f=_f[0],nf=_f[1];
char BuF[FSIZE],*InF=BuF;
void cmin(int &a,int b){if(a>b) a=b;}
void work(){
    // for(;*InF<33;++InF);
    if(!~scanf("%s\n",InF)) exit(0);
    int sz=1,ans=INF;
    for(;*InF>32;s[++sz]=*InF++^48);
    for(auto i:p) f[i.first][i.second]=INF;
    f[H][H]=0;
    p.clear();
    p.emplace_back(H,H);
    for(int i=1,mx=1;i<sz;++i){
        mx+=abs(s[i]-s[i-1])*(sz-i+1);
        np.clear();
        for(auto h:p){
            int j=h.first,k=h.second,now=s[i]+j-H,c=f[j][k],del=k-now,
                lb=max({(now-k+10)/11,now-k,now-5}),
                rb=min({(T-k+now)/11,T-k+now,now+5});
            f[j][k]=INF;
            if(c>mx) continue;
            for(int l=lb+del,tmp=del+(l-del)*11;l<=rb+del;++l,tmp+=11){
                if(abs(tmp-H)>100) continue;
                if(nf[tmp][l]==INF) np.emplace_back(tmp,l);
                cmin(nf[tmp][l],c+abs(k-l)*(sz-i+1));
            }
        }
        swap(f,nf);
        swap(p,np);
    }
    for(auto h:p){
        int i=h.first,j=h.second;
        cmin(ans,f[i][j]+abs(s[sz]+i-H));
    }
    printf("%d\n",ans);
}
int main(){
    // fread(BuF,1,FSIZE,stdin);
    memset(f,63,sizeof(_f[0]));
    memset(nf,63,sizeof(_f[0]));
    p.reserve(N<<2); 
    np.reserve(N<<2);
    // for(;*InF>32;tn=tn*10+(*InF++^48));
    // for(;tn--;work());
    for(;;work());
    fclose(stdin);
    fclose(stdout);
    return(0);
}