#include <bits/stdc++.h>
using namespace std;
priority_queue<long long int, vector<long long int>, greater<long long int>> ti;
vector<long long int> p[200005], y[300005], f(200005, 0), b(300005, 0),
    r(300005, 0), u(500005, 0);
vector<pair<long long int, long long int>> t, h;
long long int vis[200005];
map<pair<long long int, long long int>, long long int> mp;
set<pair<long long int, long long int>> s;
set<long long int> st;
map<long long int, long long int> np, v;
queue<long long int> qy;
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 bpow(long long int a, long long int b) {
  long long int res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % 1000000007;
    a = (a * a) % 1000000007;
    b >>= 1;
  }
  return res % 1000000007;
}
void fact(long long int i) {
  f[0] = 1;
  for (long long int k = 1; k <= i; k++) {
    (f[k] = f[k - 1] * k) %= 1000000007;
  }
}
long long int isprime(long long int n) {
  if (n == 1) return 0;
  for (long long int i = 2; i <= sqrt(n); i++)
    if (n % i == 0) return 0;
  return 1;
}
long long int find(long long int x) {
  if (f[x] == x)
    return x;
  else
    return f[x] = find(f[x]);
}
bool cmp(string x, string y) { return x + y < y + x; }
long long int comb(long long int i, long long int j) {
  long long int k = f[i];
  long long int g = (f[j] * (f[i - j])) % 1000000007;
  long long int h = bpow(g, 1000000007 - 2);
  return (k * h) % 1000000007;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  string s;
  cin >> s;
  vector<vector<long long int>> a(10, vector<long long int>(10, 0));
  for (long long int i = 0; i < 10; i++) {
    for (long long int j = 0; j < 10; j++) {
      long long int x = i, y = j;
      vector<long long int> dp(10, 1e18);
      for (long long int k = 0; k <= 10; k++) {
        for (long long int m = 0; m <= 10; m++) {
          if (k == 0 && m == 0) continue;
          dp[(x * k + y * m) % 10] = min(dp[(x * k + y * m) % 10], k + m);
        }
      }
      long long int sum = 0;
      for (long long int i = 1; i < s.size(); i++) {
        long long int f = s[i] - s[i - 1];
        f = (f + 10) % 10;
        if (dp[f] == 1e18) {
          sum = -1;
          break;
        }
        sum += dp[f] - 1;
      }
      a[x][y] = sum;
    }
  }
  for (long long int i = 0; i < 10; i++) {
    for (long long int j = 0; j < 10; j++) {
      cout << a[i][j] << " ";
    }
    cout << "\n";
  }
}
