#include <bits/stdc++.h>
bool local = false;
using namespace std;
template <class T>
string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}
template <class T>
void print(T v) {
  cout << ((int)(v).size()) << "\n";
  for (auto x : v) cout << x << ' ';
  cout << "\n";
};
template <class T>
void print1(T v) {
  cout << ((int)(v).size()) << "\n";
  for (auto x : v) cout << x + 1 << ' ';
  cout << "\n";
};
template <class T1, class T2>
ostream &operator<<(ostream &o, pair<T1, T2> x) {
  return o << x.first << ' ' << x.second;
}
template <class T1, class T2>
istream &operator>>(istream &o, pair<T1, T2> &x) {
  return o >> x.first >> x.second;
}
template <class T1, class T2>
pair<T1, T2> operator+(pair<T1, T2> a, pair<T1, T2> b) {
  a.first += b.first;
  a.second += b.second;
  return a;
}
template <class T1, class T2>
pair<T1, T2> operator-(pair<T1, T2> a, pair<T1, T2> b) {
  a.first -= b.first;
  a.second -= b.second;
  return a;
}
template <class T1, class T2>
void operator+=(pair<T1, T2> &a, pair<T1, T2> b) {
  a.first += b.first;
  a.second += b.second;
}
template <class T1, class T2>
void operator-=(pair<T1, T2> &a, pair<T1, T2> b) {
  a.first -= b.first;
  a.second -= b.second;
}
int nint() {
  int x;
  cin >> x;
  return x;
}
double getTime() { return clock() / (double)CLOCKS_PER_SEC; };
mt19937 rnd(0);
int rand(int n) { return rnd() % n; }
int rand(int l, int r) { return rnd() % (r - l + 1) + l; }
const int mod = 1000000000 + 7;
void initIO() {
  if (local) {
    freopen("input.txt", "r", stdin);
    srand((int)time(0));
    rnd.seed((int)time(0));
  } else {
  }
  {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
  };
}
void solve();
int main() {
  initIO();
  int tc = 1;
  for (int tt = 0; tt < (tc); tt++) {
    solve();
  }
  if (local)
    cout << "\n"
         << "time = " << getTime() << "\n";
}
int n;
int m;
int dd[10][10][10][10];
int d[10];
void bfs(int x1, int x2, int c) {
  queue<int> q;
  memset(d, -1, sizeof(d));
  int c1 = (x1 + c) % 10;
  int c2 = (x2 + c) % 10;
  q.push(c1);
  q.push(c2);
  d[c1] = d[c2] = 1;
  while (!q.empty()) {
    int o = q.front();
    q.pop();
    int c1 = (x1 + o) % 10;
    int c2 = (x2 + o) % 10;
    for (int c : {c1, c2}) {
      if (d[c] == -1) {
        d[c] = d[o] + 1;
        q.push(c);
      }
    }
  }
}
string s;
int ans[11][11];
int get(int x, int y) {
  int c = s[0] - 48;
  int ans = 0;
  for (int i = 1; i < ((int)(s).size()); i++) {
    int o = s[i] - 48;
    int k = dd[x][y][c][o];
    if (k == -1) return -1;
    ans += k - 1;
    c = o;
  }
  return ans;
}
void solve() {
  for (int i = 0; i < (10); i++)
    for (int j = 0; j < (10); j++)
      for (int k = 0; k < (10); k++) {
        bfs(i, j, k);
        for (int o = 0; o < (10); o++) dd[i][j][k][o] = d[o];
      }
  cin >> s;
  for (int i = 0; i < (10); i++) {
    for (int j = 0; j < (i + 1); j++) ans[j][i] = ans[i][j] = get(i, j);
  }
  for (int i = 0; i < (10); i++) {
    for (int j = 0; j < (10); j++) cout << ans[i][j] << ' ';
    cout << "\n";
  }
}
