1 #include<cstdio>
 2 #include<cstring>
 3 #include<iostream>
 4 #include<cstdlib>
 5 #include<cmath>
 6 using namespace std;
 7 
 8 typedef long long ll;
 9 
10 int ans,len;
11 ll one[17]={0,1,11,111,1111,11111,111111,1111111,11111111,111111111,
12             1111111111LL,11111111111LL,111111111111LL,1111111111111LL,
13             11111111111111LL,111111111111111LL,1111111111111111LL};
14 void dfs(ll x,int sum)
15 {
16     int a,b;
17     if(sum>=ans) return;
18     if(x==0)
19     {
20         ans=sum;
21         return;
22     }
23     if(x<0) x=-x;
24     ll y=x;
25     int t=0;
26     while(y!=0) t++,y/=10;
27     ll reta=x,retb=one[t+1]-x;
28     ll h=pow(10,t-1);
29     int sa=0,sb=t+1;
30     while(reta>=h) reta-=one[t],sa+=t;
31     while(retb>=h) retb-=one[t],sb+=t;
32     dfs(reta,sum+sa);
33     dfs(retb,sum+sb);
34     return;
35 }
36 
37 int main()
38 {
39     ll x;
40     while(scanf("%I64d",&x)!=EOF)
41     {
42         ans=1e9;
43         dfs(x,0);
44         printf("%d\n",ans);
45     }
46     return 0;
47 }