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 n, a[16];
long long solve(long long n, int step) {
  long long ans = (step + 1LL) * (n / a[step]);
  n %= a[step];
  if (n == 0) return ans;
  return ans + min(solve(n, step - 1), step + 1 + solve(a[step] - n, step - 1));
}
int main() {
  a[0] = 1;
  for (int i = 1; i < 16; ++i) a[i] = a[i - 1] * 10 + 1;
  cin >> n;
  cout << solve(n, 15);
}
