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 one[20];
long long dfs(long long n, int i) {
  int k;
  k = n / one[i];
  n %= one[i];
  if (n == 0) return k * i;
  return k * i + min(dfs(n, i - 1), i + dfs(one[i] - n, i - 1));
}
int main() {
  long long n;
  cin >> n;
  for (int i = 1; i <= 16; i++) one[i] = one[i - 1] * 10 + 1;
  cout << dfs(n, 16) << endl;
}
