#include <bits/stdc++.h>
using namespace std;
const int OO = 1e9;
const double EPS = 1e-9;
template <class T>
void _db(const char* dbStr, T e) {
  cout << dbStr << " = " << e << endl;
}
template <class T, class... L>
void _db(const char* dbStr, T e, L... r) {
  while (*dbStr != ',') cout << *dbStr++;
  cout << " = " << e << ',';
  _db(dbStr + 1, r...);
}
template <class S, class T>
ostream& operator<<(ostream& o, const map<S, T>& v) {
  o << "[";
  int i = 0;
  for (const pair<S, T>& pr : v)
    o << (!i++ ? "" : ", ") << "{" << pr.first << " : " << pr.second << "}";
  return o << "]";
}
template <template <class, class...> class S, class T, class... L>
ostream& operator<<(ostream& o, const S<T, L...>& v) {
  o << "[";
  int i = 0;
  for (const auto& e : v) o << (!i++ ? "" : ", ") << e;
  return o << "]";
}
template <class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& pr) {
  return o << "(" << pr.first << ", " << pr.second << ")";
}
ostream& operator<<(ostream& o, const string& s) {
  for (const char& c : s) o << c;
  return o;
}
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
template <class T>
using VVV = VV<V<T>>;
using ll = long long;
using pii = pair<int, int>;
using vi = V<int>;
using vii = V<pii>;
using vvi = VV<int>;
using mii = map<int, int>;
using umii = unordered_map<int, int>;
using si = set<int>;
using usi = unordered_set<int>;
string s;
int main() {
  ios::sync_with_stdio(false);
  cout.precision(10);
  cin.tie(0);
  cin >> s;
  for (int I = 0; I < 10; ++I) {
    for (int J = 0; J < 10; ++J) {
      vvi adjMat(10, vi(10, OO)), hasEdge(10, vi(10, 0));
      for (int i = 0; i < 10; ++i) {
        adjMat[i][(i + I) % 10] = 1;
        adjMat[i][(i + J) % 10] = 1;
        hasEdge[i][(i + I) % 10] = 1;
        hasEdge[i][(i + J) % 10] = 1;
      }
      for (int k = 0; k < 10; ++k)
        for (int i = 0; i < 10; ++i)
          for (int j = 0; j < 10; ++j)
            if (adjMat[i][k] + adjMat[k][j] < adjMat[i][j])
              adjMat[i][j] = adjMat[i][k] + adjMat[k][j];
      int curr = 0, ans = 0;
      bool good = true;
      for (int idx = 1; idx < int(s.size()); ++idx) {
        int nxt = int(s[idx] - '0');
        if (!hasEdge[curr][nxt]) {
          if (adjMat[curr][nxt] == OO) good = false;
          ans += adjMat[curr][nxt] - 1;
        }
        curr = nxt;
      }
      cout << (good ? ans : -1) << ' ';
    }
    cout << '\n';
  }
  return 0;
}
