#include<bits/stdc++.h>
#define N 5005
#define pb push_back
#define fi first
#define INF 0x3f3f3f3f
#define se second
#define pii pair<int,int>
#define MP make_pair
using namespace std; const int B=5000;
int dp[N][N*2][2],a[N],c[N],n,T; char s[N];
bool chk(int x){ if(c[x+1]) return 1;
	for(int i=x;i;i--) if(c[i]!=1) return c[i]>1;
	return 1;
}int dfs(int x,int y,int z){
	if(x==1) return abs(y-z*10);
	if(abs(y)>5000) return INF;
	if(~dp[x][y+B][z]) return dp[x][y+B][z];
	int &ans=dp[x][y+B][z],w=a[x]-z*10; ans=INF;
	if(x>5) for(int i=0;i<=1;i++) ans=min(ans,dfs(x-1,y-i,i)+abs(i+w)*x);
	else{ int ww=(powl(10,x)-1)/9;
		for(int i=0;i<=1;i++){
			if(y>0) for(int j=0;j<=abs(y)/ww+1;j++) ans=min(ans,dfs(x-1,y-i-j*ww,i)+abs(i+w+j)*x);
			else for(int j=0;j<=abs(y)/ww+1;j++) ans=min(ans,dfs(x-1,y-i+j*ww,i)+abs(i+w-j)*x);
		}
	}return ans;
}void slv(){
	n=strlen(s+1); reverse(s+1,s+n+1);
	memset(dp,-1,sizeof(dp)),memset(a,0,sizeof(a)),memset(c,0,sizeof(c));
	for(int i=1;i<=n;i++) c[i]=s[i]-'0';
	for(int i=n;i;i--){
		while(chk(i)){
			int t=min(max(c[i+1]*10+c[i]-1,1),9);
			for(int j=1;j<=i;j++){
				c[j]-=t; if(c[j]<0) c[j]+=10,c[j+1]--; 
			}a[i]+=t; }
	}printf("%d\n",dfs(n+1,a[1],0));
}signed main(){
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	while(~scanf("%s",s+1)) slv();
	return 0;
}