#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 1e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
ll m,a[5050],f[2][5050][2],ans=inf;
ll g[6][2000020],O[6]={0,1,11,111,1111,11111},pw[11],lim=1000000;
char s[5050];
int main(){
	pw[0]=1;
	fr(i,1,10) pw[i]=pw[i-1]*10;
	fr(i,0,5) fr(j,0,2*lim) g[i][j]=inf;
	g[0][lim]=0;
	fr(i,1,5){
		fr(j,-lim,lim){
			if(g[i-1][j+lim]==inf) continue;
			fr(k,-10,10) if(-lim<=(j+k*O[i])&&(j+k*O[i])<=lim) g[i][j+k*O[i]+lim]=min(g[i][j+k*O[i]+lim],g[i-1][j+lim]+i*abs(k));
		}
	}
	while(~scanf("%s",s)){
		m=strlen(s)-1;
		fr(i,0,m) a[i]=s[m-i]-'0';
		a[m+1]=a[m+2]=0;
		ll lst=0;
		fr(i,0,m){
			ll x=9*a[i]+lst;
			a[i]=x%10;
			lst=x/10;
			if(lst) m=max(m,i+1);
		}
		if(m<5){
			ll n=0;
			fr(i,0,m) n+=a[i]*pw[i];
			n/=9;
			writeln(g[5][n+lim]);
			continue;
		}
		fr(i,0,1) fr(j,0,m+1) f[i][j][0]=f[i][j][1]=inf;
		f[(m+1)&1][0][0]=0;
		f[(m+1)&1][0][1]=m+1;
		pfr(i,m,6){
			ll o=i&1;
			fr(j,0,m+1) f[o][j][0]=f[o][j][1]=inf;
			fr(j,0,m+1){
				fr(k,0,1){
					if(f[o^1][j][k]==inf) continue;
					f[o][j+k][0]=min(f[o][j+k][0],f[o^1][j][k]+i*abs(a[i]-10*k));
					f[o][j+k][1]=min(f[o][j+k][1],f[o^1][j][k]+i*abs(a[i]-10*k+1));
				}
			}
		}
		ll n=0;
		fr(i,0,5) n+=a[i]*pw[i];
		fr(i,6,m) n+=a[i];
		fr(i,0,m+1) fr(j,0,1) ans=min(ans,f[0][i][j]+g[5][(n-j*999999-9*i)/9+lim]);
		writeln(ans);
	}
}