#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define rep2(i,a,b) for (int i = a; i < b; i++)
#define rrep2(i,a,b) for (int i = a-1; i >= b; i--)
#define rep3(i,a,b,c) for (int i = a; i < b; i+=c)
#define rrep3(i,a,b,c) for (int i = a-1; i >= b; i-=c)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

int n;
string s;
mint dp[200010][3];
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>n>>s;
    rep(i,n){
        dp[i][0]++;
        if(s[i]=='?'){
            rep(j,3)rep(k,3){
                if(j==k)dp[i+1][j]+=4*dp[i][k];
                else dp[i+1][j]+=3*dp[i][k];
            }
        }else{
            rep(j,3){
                dp[i+1][(10*j+s[i]-'0')%3]+=dp[i][j];
            }
        }
        dp[i][0]--;
    }
    mint ans=0;
    rep(i,n+1)ans+=dp[i][0];
    cout<<ans.val()<<"\n";
}