#include <bits/stdc++.h>
using namespace std;
long long int dx[] = {1, -1, 0, 0};
long long int dy[] = {0, 0, -1, 1};
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int power_mod(long long int a, long long int n) {
  long long int res = 1;
  while (n > 0) {
    if (n & 1)
      res = ((res % 1000000007) * (a % 1000000007)) % 1000000007, n--;
    else
      a = ((a % 1000000007) * (a % 1000000007)) % 1000000007, n /= 2;
  }
  return res;
}
long long int nCr(long long int n, long long int r) {
  if (r > n) return 0;
  double res = 1;
  for (long long int i = 1; i <= r; i++) res = (res * (n - r + i)) / i;
  return (long long int)(res + 0.01);
}
long long int power(long long int a, long long int n) {
  long long int res = 1;
  for (long long int i = 0; i < n; i++) res = res * a;
  return res;
}
bool cmp(pair<long long int, long long int> a,
         pair<long long int, long long int> b) {
  if (a.first < b.first)
    return true;
  else if (a.first == b.first)
    return a.second > b.second;
  else
    return false;
}
bool is_power_of_two(long long int n) {
  for (long long int i = 0; i < 32; i++) {
    if ((1 << i) == n) return true;
  }
  return false;
}
long long int dp[10][10][10][10];
void init() {
  for (long long int i = 0; i < 10; i++) {
    for (long long int j = 0; j < 10; j++) {
      for (long long int k = 0; k < 10; k++) {
        long long int vis[10];
        for (long long int p = 0; p < 10; p++) vis[p] = 1000000000000000000;
        for (long long int l = 0; l < 11; l++) {
          for (long long int m = 0; m < 11; m++) {
            if (l == 0 && m == 0) continue;
            vis[(k + (l * i + j * m)) % 10] =
                min(l + m, vis[(k + (l * i + j * m)) % 10]);
          }
        }
        for (long long int p = 0; p < 10; p++) dp[i][j][k][p] = vis[p];
      }
    }
  }
}
void solve() {
  init();
  string s;
  cin >> s;
  long long int si = s.size();
  for (long long int i = 0; i < 10; i++) {
    for (long long int j = 0; j < 10; j++) {
      long long int cnt = 0;
      for (long long int k = 1; k < s.size(); k++) {
        if (dp[i][j][s[k - 1] - '0'][s[k] - '0'] == 1000000000000000000) {
          cnt = -1;
          break;
        } else
          cnt += dp[i][j][s[k - 1] - '0'][s[k] - '0'] - 1;
      }
      cout << cnt << " ";
    }
    cout << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int t = 1;
  while (t--) {
    solve();
  }
}
