#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
using namespace std;
const int inf = (int)1e9 + 1;
int n;
void get(vector<int>& va, int x) {
  int pre = x;
  va[x] = 1;
  int cnt = 1;
  while (1) {
    cnt++;
    int y = (pre + x) % 10;
    if (y == x) break;
    va[y] = cnt;
    pre = y;
  }
}
int have(const vector<int>& a, const vector<int>& b, int x, int y) {
  int cur = (y - x + 10) % 10;
  int ans = a[cur];
  if (b[cur] != -1)
    if (ans == -1)
      ans = b[cur];
    else
      ans = min(ans, b[cur]);
  for (int i = 0; i < 10; i++) {
    if (a[i] == -1) continue;
    if (b[(cur - i + 10) % 10] == -1) continue;
    if (ans == -1 || ans > a[i] + b[(cur - i + 10) % 10])
      ans = a[i] + b[(cur - i + 10) % 10];
  }
  return ans;
}
char* s;
int solve(int X, int Y) {
  vector<int> a(10, -1);
  vector<int> b(10, -1);
  get(a, X);
  get(b, Y);
  int ans = 0;
  for (int i = 1; i < n; i++) {
    int x = s[i - 1];
    int y = s[i];
    int cur = (y - x + 10) % 10;
    int t = a[cur];
    if (b[cur] != -1)
      if (t == -1)
        t = b[cur];
      else
        t = min(t, b[cur]);
    for (int i = 0; i < 10; i++) {
      if (a[i] == -1) continue;
      if (b[(cur - i + 10) % 10] == -1) continue;
      if (t == -1 || t > a[i] + b[(cur - i + 10) % 10])
        t = a[i] + b[(cur - i + 10) % 10];
    }
    if (t == -1) return -1;
    ans += t - 1;
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  string p;
  cin >> p;
  n = p.size();
  s = new char[n];
  for (int i = 0; i < n; i++) s[i] = p[i] - '0';
  int ans[10][10];
  for (int x = 0; x < 10; x++) {
    for (int y = x; y < 10; y++) ans[x][y] = ans[y][x] = solve(x, y);
  }
  for (int x = 0; x < 10; x++) {
    for (int y = 0; y < 10; y++) cout << ans[x][y] << " ";
    cout << "\n";
  }
  return 0;
}
