Problem: Suppose you have a special x-y-counter. This counter can store some value as a decimal number; at first, the counter has value 0. 

The counter performs the following algorithm: it prints its lowest digit and, after that, adds either x or y to its value. So all sequences this counter generates are starting from 0. For example, a 4-2-counter can act as follows:

  1. it prints 0, and adds 4 to its value, so the current value is 4, and the output is 0; 
  2. it prints 4, and adds 4 to its value, so the current value is 8, and the output is 04; 
  3. it prints 8, and adds 4 to its value, so the current value is 12, and the output is 048; 
  4. it prints 2, and adds 2 to its value, so the current value is 14, and the output is 0482; 
  5. it prints 4, and adds 4 to its value, so the current value is 18, and the output is 04824. 



This is only one of the possible outputs; for example, the same counter could generate 0246802468024 as the output, if we chose to add 2 during each step.

You wrote down a printed sequence from one of such x-y-counters. But the sequence was corrupted and several elements from the sequence could be erased.

Now you'd like to recover data you've lost, but you don't even know the type of the counter you used. You have a decimal string s — the remaining data of the sequence. 

For all 0 ≤ x, y < 10, calculate the minimum number of digits you have to insert in the string s to make it a possible output of the x-y-counter. Note that you can't change the order of digits in string s or erase any of them; only insertions are allowed.

Input

The first line contains a single string s (1 ≤ |s| ≤ 2 ⋅ 10^6, s_i ∈ \{0 - 9\}) — the remaining data you have. It's guaranteed that s_1 = 0.

Output

Print a 10 × 10 matrix, where the j-th integer (0-indexed) on the i-th line (0-indexed too) is equal to the minimum number of digits you have to insert in the string s to make it a possible output of the i-j-counter, or -1 if there is no way to do so.

Example

Input


0840


Output


-1 17 7 7 7 -1 2 17 2 7 
17 17 7 5 5 5 2 7 2 7 
7 7 7 4 3 7 1 7 2 5 
7 5 4 7 3 3 2 5 2 3 
7 5 3 3 7 7 1 7 2 7 
-1 5 7 3 7 -1 2 9 2 7 
2 2 1 2 1 2 2 2 0 1 
17 7 7 5 7 9 2 17 2 3 
2 2 2 2 2 2 0 2 2 2 
7 7 5 3 7 7 1 3 2 7 

Note

Let's take, for example, 4-3-counter. One of the possible outcomes the counter could print is 0(4)8(1)4(7)0 (lost elements are in the brackets).

One of the possible outcomes a 2-3-counter could print is 0(35)8(1)4(7)0.

The 6-8-counter could print exactly the string 0840.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-6;
const long long INF = 0x3f3f3f3f3f3f3f3fll;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int maxn = 2e6 + 100;
char s[maxn];
int ans[20][20], a[maxn];
int g[20][20][20], cnt[20], dig[20][20], vis[10][10];
void solve() {
  scanf("%s", s + 1);
  int n = strlen(s + 1);
  for (int i = 1; (i) <= (n - 1); i++) {
    a[i] = ((s[i + 1] - '0') - (s[i] - '0') + 10) % 10;
  }
  for (int i = 0; (i) < (10); i++) {
    int now = i;
    while (now) {
      dig[i][++cnt[i]] = now;
      now = now + i;
      now %= 10;
    }
    dig[i][++cnt[i]] = now;
  }
  dig[0][1] = 0;
  cnt[0] = 1;
  memset(g, -1, sizeof(g));
  for (int i = 0; (i) < (10); i++)
    for (int j = 0; (j) < (10); j++)
      for (int k = 0; (k) < (10); k++) {
        int res = inf, mark = 0, flag = 0;
        for (int u = 1; (u) <= (cnt[i]); u++) {
          mark++;
          if (dig[i][u] == k) {
            flag = 1;
            break;
          }
        }
        if (flag) res = min(res, mark);
        mark = 0, flag = 0;
        for (int u = 1; (u) <= (cnt[j]); u++) {
          mark++;
          if (dig[j][u] == k) {
            flag = 1;
            break;
          }
        }
        if (flag) res = min(res, mark);
        for (int ui = 1; (ui) <= (cnt[i]); ui++) {
          mark = ui, flag = 0;
          for (int uj = 1; (uj) <= (cnt[j]); uj++) {
            mark++;
            if ((dig[j][uj] + dig[i][ui]) % 10 == k) {
              flag = 1;
              break;
            }
          }
          if (flag) res = min(res, mark);
        }
        for (int uj = 1; (uj) <= (cnt[j]); uj++) {
          mark = uj, flag = 0;
          for (int ui = 1; (ui) <= (cnt[i]); ui++) {
            mark++;
            if ((dig[j][uj] + dig[i][ui]) % 10 == k) {
              flag = 1;
              break;
            }
          }
          if (flag) res = min(res, mark);
        }
        g[i][j][k] = g[j][i][k] = (res == inf) ? -1 : res;
      }
  for (int i = 0; (i) < (10); i++)
    for (int j = 0; (j) < (10); j++)
      for (int k = 1; (k) <= (n - 1); k++) {
        if (~g[i][j][a[k]] && !vis[i][j])
          ans[i][j] += g[i][j][a[k]];
        else
          ans[i][j] = -1, vis[i][j] = 1;
      }
  for (int i = 0; (i) < (10); i++) {
    for (int j = 0; (j) < (10); j++) {
      if (~ans[i][j])
        printf("%d ", ans[i][j] - n + 1);
      else
        printf("%d ", ans[i][j]);
    }
    printf("\n");
  }
}
int main() {
  solve();
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  ;
  return 0;
}