Prof. Vasechkin wants to represent positive integer n as a sum of addends, where each addends is an integer number containing only 1s. For example, he can represent 121 as 121=111+11+–1. Help him to find the least number of digits 1 in such sum.

Input

The first line of the input contains integer n (1 ≤ n < 1015).

Output

Print expected minimal number of digits 1.

Examples

Input

121


Output

6
#include <bits/stdc++.h>
using namespace std;
long long a[20];
long long dfs(long long n, long long t) {
  long long num = n / a[t];
  n = n % a[t];
  if (n == 0) return num * t;
  return num * t + min(t + dfs(a[t] - n, t - 1), dfs(n, t - 1));
}
int main() {
  long long n;
  a[0] = 0;
  for (int i = 1; i <= 16; i++) a[i] = a[i - 1] * 10 + 1;
  cin >> n;
  cout << dfs(n, 16) << endl;
}
