#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;

mint dp[10001][1024][2][2];

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  string S;
  cin >> S;

  ll N = S.size();
  dp[0][0][0][1] = 1;
  for(ll i = 0; i < N; i++) {
    ll d = S[i] - '0';
    for(ll j = 0; j < 1 << 10; j++) {
      for(ll k = 0; k < 10; k++) {
        ll nj = j ^ (1 << k);
        if(!k) {
          if(k < d) {
            dp[i + 1][nj][1][0] += dp[i][j][0][0] + dp[i][j][1][0];
            dp[i + 1][j][1][1] += dp[i][j][0][1] + dp[i][j][1][1];
          }
          if(k == d) {
            dp[i + 1][nj][0][0] += dp[i][j][0][0];
            dp[i + 1][nj][1][0] += dp[i][j][1][0];
            dp[i + 1][j][0][1] += dp[i][j][0][1];
            dp[i + 1][j][1][1] += dp[i][j][1][1];
          }
        }
        else {
          if(k < d) { dp[i + 1][nj][1][0] += dp[i][j][0][0] + dp[i][j][0][1] + dp[i][j][1][0] + dp[i][j][1][1]; }
          else if(k == d) {
            dp[i + 1][nj][1][0] += dp[i][j][1][0] + dp[i][j][1][1];
            dp[i + 1][nj][0][0] += dp[i][j][0][0] + dp[i][j][0][1];
          }
          else {
            dp[i + 1][nj][1][0] += dp[i][j][1][0] + dp[i][j][1][1];
          }
        }
      }
    }
  }

  cout << (dp[N][0][0][0] + dp[N][0][1][0]).val() << "\n";
}