#include <iostream>
#include <vector>

using namespace std;

const int MAXN = 1e6 + 5, Mod = 998244353;

int n, ans, dp[MAXN][2][3], a[3] = {4, 0, 4};
string s;

int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> s, n = s.size();
  s = " " + s, dp[0][0][0] = 1;
  for (int i = 0; i < n; i++) {
    for (int f : {0, 1}) {
      int r = (f ? 9 : s[i + 1] - '0');
      for (int u : {0, 1, 2}) {
        if (!dp[i][f][u]) continue;
        for (int x = 0; x <= r; x++) {
          if (x != a[u] || u < 2)
            (dp[i + 1][(x < r || f)][(x == a[u] ? u + 1 : x == a[0])] += dp[i][f][u]) %= Mod;
        }
      }
    }
  }
  for (int f : {0, 1}) {
    for (int u : {0, 1, 2}) {
      (ans += dp[n][f][u]) %= Mod;
    }
  }
  cout << (ans + Mod - 1) % Mod;
  return 0;
}