#include <bits/stdc++.h>

using namespace std;

#define int long long

const int N = 1e6 + 5, mod = 998244353;

int n, dp[N][10][10][2], x[N];

string s;

signed main() {
  cin >> s;
  n = s.size();
  s = " " + s;
  for (int i = 1; i <= n; i++) {
    x[i] = (int)(s[i] - '0');
  }
  dp[0][9][9][1] = 1;
  for (int i = 1; i <= n; i++) {
    for (int a = 0; a <= 9; a++) {
      for (int b = 0; b <= 9; b++) {
        for (int c = 0; c <= 9; c++) {
          if (c == 4 && b == 0 && a == 4) {
            continue;
          }
          if (c < x[i]) {
            dp[i][c][b][0] = (dp[i][c][b][0] + dp[i - 1][b][a][1] + dp[i - 1][b][a][0]) % mod;
          }
          else if (c == x[i]) {
            dp[i][c][b][1] = (dp[i][c][b][1] + dp[i - 1][b][a][1]) % mod;
            dp[i][c][b][0] = (dp[i][c][b][0] + dp[i - 1][b][a][0]) % mod;
          }
          else {
            dp[i][c][b][0] = (dp[i][c][b][0] + dp[i - 1][b][a][0]) % mod;
          }
        }
      }
    }
  }
  int ans = 0;
  for (int a = 0; a <= 9; a++) {
    for (int b = 0; b <= 9; b++) {
      ans += dp[n][a][b][0] + dp[n][a][b][1];
      ans %= mod;
    }
  }
  cout << ans - 1;
  return 0;
}