#include #define _1 (__int128)1 using namespace std; using ll = long long; void FileIO (const string s) { freopen(string(s + ".in").c_str(), "r", stdin); freopen(string(s + ".out").c_str(), "w", stdout); } const int N = 1e6 + 10, mod = 998244353; string s; int n, dp[N][2][3]; // 0 ???1 ??? 4?2 ??? 40 signed main () { ios::sync_with_stdio(0), cin.tie(0); // FileIO(""); cin >> s, n = s.size(), dp[0][0][0] = 1, s = " " + s; for (int i = 0; i < n; i++) { for (int j = 0; j < 10; j++) { if (j == 4) { if (j < s[i + 1] - '0') { dp[i + 1][1][1] = (0ll + dp[i + 1][1][1] + dp[i][0][0] + dp[i][0][1] + dp[i][1][0] + dp[i][1][1]) % mod; } else if (j == s[i + 1] - '0') { dp[i + 1][1][1] = (0ll + dp[i + 1][1][1] + dp[i][1][0] + dp[i][1][1]) % mod; dp[i + 1][0][1] = (0ll + dp[i + 1][0][1] + dp[i][0][0] + dp[i][0][1]) % mod; } else { dp[i + 1][1][1] = (0ll + dp[i + 1][1][1] + dp[i][1][0] + dp[i][1][1]) % mod; } } else if (j == 0) { if (j < s[i + 1] - '0') { dp[i + 1][1][0] = (0ll + dp[i + 1][1][0] + dp[i][0][0] + dp[i][0][2] + dp[i][1][0] + dp[i][1][2]) % mod; dp[i + 1][1][2] = (0ll + dp[i + 1][1][2] + dp[i][0][1] + dp[i][1][1]) % mod; } else if (j == s[i + 1] - '0') { dp[i + 1][0][0] = (0ll + dp[i + 1][0][0] + dp[i][0][0] + dp[i][0][2]) % mod; dp[i + 1][0][2] = (0ll + dp[i + 1][0][2] + dp[i][0][1]) % mod; dp[i + 1][1][0] = (0ll + dp[i + 1][1][0] + dp[i][1][0] + dp[i][1][2]) % mod; dp[i + 1][1][2] = (0ll + dp[i + 1][1][2] + dp[i][1][1]) % mod; } else { dp[i + 1][1][0] = (0ll + dp[i + 1][1][0] + dp[i][1][0] + dp[i][1][2]) % mod; dp[i + 1][1][2] = (0ll + dp[i + 1][1][2] + dp[i][1][1]) % mod; } } else { if (j < s[i + 1] - '0') { dp[i + 1][1][0] = (0ll + dp[i + 1][1][0] + dp[i][0][0] + dp[i][0][1] + dp[i][0][2] + dp[i][1][0] + dp[i][1][1] + dp[i][1][2]) % mod; } else if (j == s[i + 1] - '0') { dp[i + 1][1][0] = (0ll + dp[i + 1][1][0] + dp[i][1][0] + dp[i][1][1] + dp[i][1][2]) % mod; dp[i + 1][0][0] = (0ll + dp[i + 1][0][0] + dp[i][0][0] + dp[i][0][1] + dp[i][0][2]) % mod; } else { dp[i + 1][1][0] = (0ll + dp[i + 1][1][0] + dp[i][1][0] + dp[i][1][1] + dp[i][1][2]) % mod; } } } } /*for (int i = 0; i < 2; i++) for (int j = 0; j < 3; j++) cout << dp[0][i][j] << ' '; cout << '\n'; for (int i = 0; i < 2; i++) for (int j = 0; j < 3; j++) cout << dp[1][i][j] << ' '; cout << '\n';*/ cout << (0ll + dp[n][0][0] + dp[n][0][1] + dp[n][0][2] + dp[n][1][0] + dp[n][1][1] + dp[n][1][2] + mod - 1) % mod; return 0; }