#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

template <class T>
vector<int> MP(const T& pattern) {
  const int n = pattern.size();
  vector<int> pi(n + 1);
  pi[0] = -1;
  int border = 0;
  for (int i = 1; i < n; i++, border++) {
    const auto c = pattern[i];
    pi[i] = border;
    while (border != -1 && pattern[border] != c) {
      border = pi[border];
    }
  }
  pi[n] = border;
  return pi;
}

// aE + b
struct S {
  mint a, b;
};

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  string s;
  cin >> s;
  for (char& c : s) c -= '0';
  auto border = MP(s);
  int n = s.size();
  vector<array<int, 10>> nxt(n);
  nxt[0][s[0]] = 1;
  rep(i, n) if (i) {
    nxt[i] = nxt[border[i]];
    nxt[i][s[i]] = i + 1;
  }
  vector<S> dp(n + 1);
  dp[0] = {1, 0};
  rep(i, n) {
    S res = dp[i];
    res.b--;
    res.a *= 10, res.b *= 10;
    rep(x, 10) if (int j = nxt[i][x]; j != i + 1) {
      res.a -= dp[j].a;
      res.b -= dp[j].b;
    }
    dp[i+1] = res;
  }
  auto [a, b] = dp[n];
  auto ans = -b / a;
  cout << (ans - (n - 1)).val() << endl;
}