#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
#pragma optimize("-O3")
inline long long read() {
  long long x = 0;
  int f = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') f |= (ch == '-'), ch = getchar();
  while (ch >= '0' && ch <= '9')
    x = (x << 3) + (x << 1) + ch - '0', ch = getchar();
  return x = f ? -x : x;
}
inline void write(long long x, bool f) {
  if (x == 0) {
    putchar('0');
    if (f)
      putchar('\n');
    else
      putchar(' ');
    return;
  }
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  static char s[23];
  int l = 0;
  while (x != 0) s[l++] = x % 10 + 48, x /= 10;
  while (l) putchar(s[--l]);
  if (f)
    putchar('\n');
  else
    putchar(' ');
}
int lowbit(int x) { return x & (-x); }
template <class T>
T big(const T &a1, const T &a2) {
  return a1 > a2 ? a1 : a2;
}
template <class T>
T sml(const T &a1, const T &a2) {
  return a1 < a2 ? a1 : a2;
}
template <typename T, typename... R>
T big(const T &f, const R &...r) {
  return big(f, big(r...));
}
template <typename T, typename... R>
T sml(const T &f, const R &...r) {
  return sml(f, sml(r...));
}
void debug_out() { cerr << '\n'; }
template <typename T, typename... R>
void debug_out(const T &f, const R &...r) {
  cerr << f << " ";
  debug_out(r...);
}
const long long INFLL = 0x3f3f3f3f3f3f3f3fLL;
const int HMOD[] = {1000000009, 1004535809};
const long long BASE[] = {1572872831, 1971536491};
const int mod = 1e9 + 0;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const int MXN = 2e6 + 7;
const int MXE = 1e6 + 7;
int n, m;
char s[MXN];
long long ar[20][20];
int mp[11][11][11][11];
long long check(int a, int b) {
  int sum = 0;
  long long cnt = 0;
  for (int i = 1, aim; i < n; ++i) {
    if (s[i] - '0' >= sum)
      aim = s[i] - '0' - aim;
    else
      aim = s[i] - '0' - aim + 10;
    if (mp[a][b][sum][s[i] - '0'] == INF) return -1;
    cnt += mp[a][b][sum][s[i] - '0'];
    sum = s[i] - '0';
  }
  return cnt;
}
void init() {
  for (int a = 0; a < 10; ++a) {
    for (int b = 0; b < 10; ++b) {
      for (int x = 0; x < 10; ++x) {
        for (int y = 0, aim; y < 10; ++y) {
          if (x == y && (a == 0 || b == 0)) {
            mp[a][b][x][y] = 0;
            continue;
          }
          if (x <= y)
            aim = y - x;
          else
            aim = y - x + 10;
          int tmp = INF;
          for (int j = 0; j <= 20; ++j) {
            for (int k = 0; k <= 20; ++k) {
              if (j + k == 0) continue;
              if ((j * a + k * b) % 10 == aim) tmp = sml(tmp, j + k - 1);
            }
          }
          mp[a][b][x][y] = tmp;
        }
      }
    }
  }
}
int main() {
  scanf("%s", s);
  n = strlen(s);
  memset((ar), (-1), sizeof((ar)));
  init();
  for (int i = 0; i < 10; ++i) {
    for (int j = i; j < 10; ++j) {
      ar[i][j] = check(i, j);
    }
  }
  if (s[0] != '0') memset((ar), (-1), sizeof((ar)));
  for (int i = 0; i < 10; ++i) {
    for (int j = 0; j < 10; ++j) {
      if (ar[i][j] == -1) {
        printf("%lld ", ar[j][i]);
      } else {
        if (ar[j][i] == -1)
          printf("%lld ", ar[i][j]);
        else
          printf("%lld ", sml(ar[i][j], ar[j][i]));
      }
    }
    printf("\n");
  }
  return 0;
}
