#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;

constexpr int FACT_SIZE = 1000000;
mint Fact[FACT_SIZE + 1];
mint iFact[FACT_SIZE + 1];
const auto fact_init = [] {
    Fact[0] = mint::raw(1);
    for(int i = 1; i <= FACT_SIZE; ++i) {
        Fact[i] = Fact[i-1] * i;
    }
    iFact[FACT_SIZE] = Fact[FACT_SIZE].inv();
    for(int i = FACT_SIZE; i; --i) {
        iFact[i-1] = iFact[i] * i;
    }
    return false;
}();

mint comb(int n, int k) {
    if (k == 0) return mint::raw(1);
    assert(n >= 0 && k >= 0);
    if (k > n) return mint::raw(0);
    return Fact[n] * iFact[n - k] * iFact[k];
}

mint icomb(int n, int k) {
    return iFact[n] * Fact[n - k] * Fact[k];
}

mint fact(int n) {return Fact[n];}
mint perm(int n, int k) {
    assert(0 <= n);
    return Fact[n] * iFact[n - k];
}

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  string s;
  cin >> s;
  int n = s.size();
  VI bs(n + 1);
  rep(i, n) bs[i + 1] = bs[i] ^ (1 << (s[i] - '0'));
  mint dp[11];
  dp[0] = 1;
  mint ans;
  rrep(i, n) {
    if (i == 0 && s[i] != '0') ans += (s[i] - '0' - 1) * dp[1] * icomb(10, 1);
    else ans += 9 * dp[1] * icomb(10, 1);
    if (i) {
      int pc = popcount(0U + bs[i]);
      rep(x, s[i] - '0') {
        int npc = pc + (bs[i] >> x & 1 ? -1 : 1);
        ans += dp[npc] * icomb(10, npc);
      }
    }
    mint ndp[11];
    rep(i, 11) {
      if (i < 10) ndp[i+1] += dp[i] * (10 - i);
      if (i) ndp[i-1] += dp[i] * i;
    }
    swap(dp, ndp);
  }
  if (bs[n] == 0) ans++;
  cout << ans.val() << '\n';
}