#include #include #define pass (void)0 using namespace std; using namespace atcoder; using mint = modint998244353; using ll = long long; int main() { string S; cin >> S; int L = S.length(); vector dp(2, vector(2, vector(2, vector(100, 0)))); dp[0][0][0][0] = 1; for (int i = 0; i < L; i++) { for (int zero = 0; zero < 2; zero++) { for (int small = 0; small < 2; small++) { for (int j = 0; j < 100; j++) { if (zero == 0) { dp[1][zero][1][j] += dp[0][zero][small][j]; for (int k = 1; k <= (small ? 9 : S[i] - '0'); k++) { dp[1][1][small || (k < S[i] - '0')][k] += dp[0][zero][small][j]; } continue; } for (int k = 0; k <= (small ? 9 : S[i] - '0'); k++) { if (j == 40 && k == 4) continue; dp[1][1][small || (k < S[i] - '0')][(j * 10 % 100 + k) % 100] += dp[0][zero][small][j]; } } } } // dp[1] の値を dp[0] に移し替え、dp[1]をリセット for (int i = 0; i < 2; i++) { for (int j = 0; j < 2; j++) { for (int k = 0; k < 100; k++) { dp[0][i][j][k] = dp[1][i][j][k]; dp[1][i][j][k] = 0; } } } } mint ans = 0; for (int i = 0; i < 2; i++) { for (int j = 0; j < 100; j++) { ans += dp[0][1][i][j]; } } cout << ans.val() << endl; }