#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define fo(i,a,b) for(int i=a;i<=b;++i)
#define fod(i,a,b) for(int i=a;i>=b;--i)
#define jx 999999999
int n;
char s[5011];
int a[5011];
int f[2][120011][3];
int mid=60001;
int zc[2][120011],len[2];
int bz[120011],g[2000011];
int Abs(int x){
	if(x<0)return -x;
	return x;
}
int d[2000011],er[10];
void ycl(){
	fo(i,0,1)
	fo(j,1,100002)
	fo(k,0,2){
		f[i][j][k]=jx;
	}
	er[0]=9;
	fo(i,1,9)er[i]=er[i-1]*10+9;
	fo(i,1,2000000){
		g[i]=jx;
	}
	int h=0,t=1;
	d[1]=0;
	while(h<t){
		int x=d[++h];
		fo(i,0,5){
			if(x+er[i]<=2000000&&g[x+er[i]]>(g[x]+i+1)){
				g[x+er[i]]=g[x]+1+i;
				d[++t]=x+er[i];
			}
			int r=Abs(x-er[i]);
			if(g[r]>g[x]+1+i){
				g[r]=g[x]+1+i;
				d[++t]=r;
			}
		}
	}
}
int main(){
//	freopen("ones.in","r",stdin);
//	freopen("ones.out","w",stdout);
	int t=1;
//	scanf("%d",&t);
	ycl();
	while(t){
//		--t;
		char c=getchar();
		while(c<'0'||c>'9'){
			c=getchar();
			if(c==EOF)break;
		}
		if(c==EOF)break;
		n=0;
		while(c>='0'&&c<='9'){
			s[n++]=c;		
			c=getchar();
		}
//		scanf("%s",s);
//		n=strlen(s);
		fo(i,mid-n*10,mid+n*10){
			bz[i]=0;
		}
		fo(i,0,n-1)a[n-i]=s[i]-'0';
		int u2=0;
		fo(i,1,n){
			u2+=a[i]*9;
			a[i]=u2%10;
			u2/=10;
		}
		while(u2){
			a[++n]=u2%10;u2/=10;
		}
		while(n<6)++n;
		int b2=(n+1)&1;
		f[b2][mid][1]=0;
		f[b2][mid+1][0]=n;
		zc[b2][++len[b2]]=mid;
		zc[b2][++len[b2]]=mid+1;
		fod(i,n,6){
			int u=(i&1);
			int v=(u^1);
			fo(j,1,len[v]){
				fo(k,-1,1){
					int r=zc[v][j];
					if(f[v][r][k+1]!=jx&&Abs(r-mid)<=n*5){
						int h=k*10+a[i];
						if(bz[r+h]!=i){
							bz[r+h]=i;
							zc[u][++len[u]]=r+h;
						}
						if(bz[r+h+1]!=i){
							bz[r+h+1]=i;
							zc[u][++len[u]]=r+h+1;
						}
						if(bz[r+h-1]!=i){
							bz[r+h-1]=i;
							zc[u][++len[u]]=r+h-1;
						}
						if(f[u][r+h][1]>f[v][r][k+1]+Abs(h)*(i-1)){
							f[u][r+h][1]=f[v][r][k+1]+Abs(h)*(i-1);
						}
						if(f[u][r+h+1][0]>f[v][r][k+1]+Abs(h+1)*(i-1)){
							f[u][r+h+1][0]=f[v][r][k+1]+Abs(h+1)*(i-1);
						}
						if(f[u][r+h-1][2]>f[v][r][k+1]+Abs(h-1)*(i-1)){
							f[u][r+h-1][2]=f[v][r][k+1]+Abs(h-1)*(i-1);
						}
					}f[v][r][k+1]=jx;
				}
			}
			len[v]=0;
		}
		int u=0;
		fod(i,5,1){
			u=u*10+a[i];
		}
		int ans=jx;
		fo(j,1,len[0]){
			int r=zc[0][j];
			fo(k,-1,1){
				if(f[0][r][k+1]!=jx){
					ans=min(ans,f[0][r][k+1]+g[Abs(u+r-mid+k*100000)]);
					f[0][r][k+1]=jx;
				}
			}
		}
		while(n){
			a[n--]=0;
		}
		len[0]=0;
		printf("%d\n",ans);
	}
	return 0;
}