#include #include #include #include #include using i64 = long long; using u64 = unsigned long long; #define rep(i,n) for(int i=0; i void chmin(A& l, const A& r){ if(r < l) l = r; } template void chmax(A& l, const A& r){ if(l < r) l = r; } using namespace std; int main(){ char *S = (char *)mmap(NULL, 1000010, PROT_READ, MAP_PRIVATE, 0, 0); auto proc = [&](vector f, i64 d) -> vector { if(d == 4) return { 0, f[0] + f[1], 0 }; if(d == 0) return { f[0] + f[2], 0, f[1] }; return { f[0] + f[1] + f[2], 0, 0 }; }; auto vadd = [&](vector& f, vector s, i64 t){ rep(x,3) f[x] += s[x] * t; }; vector st = { 1, 0, 0 }; vector dp(3); int ex = 0; bool beg = true; for(int i=0; S[i]!='\n'; i++){ i64 d = S[i] - '0'; if(beg){ dp.assign(3, 0); rep(e,d) if(e != 0) vadd(dp, proc(st, e), 1); beg = false; } else { vector nx(3); nx[0] = ((dp[0] + dp[1] + dp[2]) * 9 - dp[1]) % 998244353; nx[1] = dp[0] + dp[1]; nx[2] = dp[1]; i64 igcnt = d; if(4 < d){ igcnt--; if(ex == 0){ nx[0] += d-1; nx[1] += 1; } else if(ex == 1){ nx[0] += d-2; nx[1] += 1; nx[2] += 1; } else if(ex == 2){ nx[0] += d-1; } } else if(0 < d){ igcnt--; if(ex == 0){ nx[0] += d; } else if(ex == 1){ nx[0] += d-1; nx[2] += 1; } else if(ex == 2){ nx[0] += d; } } nx[1] += 1; nx[0] += 8; swap(dp, nx); } if(ex < 3){ if(d == 4){ if(ex == 2) ex = 3; else ex = 1; } else if(d == 0){ if(ex == 1) ex = 2; else ex = 0; } else ex = 0; } } i64 ans = dp[0] + dp[1] + dp[2]; if(ex < 3) ans += 1; ans %= 998244353; cout << ans << '\n'; return 0; }