#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include #include using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector #define vs vector #define vc vector #define vl vector #define vb vector #define vvi vector> #define vvc vector> #define vvl vector> #define vvb vector> #define vvvi vector>> #define vvvl vector>> #define pii pair #define pil pair #define pli pair #define pll pair #define vpii vector> #define vpll vector> #define vvpii vector>> #define vvpll vector>> template void debug(T e){ cerr << e << endl; } template void debug(vector &v){ rep(i, v.size()){ cerr << v[i] << " "; } cerr << endl; } template void debug(vector> &v){ rep(i, v.size()){ rep(j, v[i].size()){ cerr << v[i][j] << " "; } cerr << endl; } } template void debug(vector> &v){ rep(i,v.size()){ cerr << v[i].first << " " << v[i].second << endl; } } template void debug(set &st){ for (auto itr = st.begin(); itr != st.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template void debug(multiset &ms){ for (auto itr = ms.begin(); itr != ms.end(); itr++){ cerr << *itr << " "; } cerr << endl; } template void debug(map &mp){ for (auto itr = mp.begin(); itr != mp.end(); itr++){ cerr << itr->first << " " << itr->second << endl; } } void debug_out(){ cerr << endl; } template void debug_out(Head H, Tail... T){ cerr << H << " "; debug_out(T...); } int main(){ ll N; cin >> N; string S; cin >> S; ll ans = 0; vvl dp(N, vl(3, 0)); for (ll i = 0; i < N; i++){ if (S[i] == '?'){ dp[i][0] = (dp[i][0] + 4) % mod2; dp[i][1] = (dp[i][1] + 3) % mod2; dp[i][2] = (dp[i][2] + 3) % mod2; } else{ dp[i][((ll)(S[i] - '0')) % 3]++; dp[i][((ll)(S[i] - '0')) % 3] %= mod2; } ans = (ans + dp[i][0]) % mod2; if (i < N - 1){ for (ll j = 0; j < 3; j++){ if (S[i + 1] == '?'){ for (ll k = 0; k <= 9; k++){ dp[i + 1][(j * 10 + k) % 3] += dp[i][j]; dp[i + 1][(j * 10 + k) % 3] %= mod2; } } else{ dp[i + 1][(j * 10 + (ll)(S[i + 1] - '0')) % 3] += dp[i][j]; dp[i + 1][(j * 10 + (ll)(S[i + 1] - '0')) % 3] %= mod2; } } } } //debug(dp); cout << ans << endl; }