#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)


int main(){
    int n; cin >> n;
    string s; cin >> s;
    vvmi dp(n, vmi(3, mint(0)));
    if(s[0] == '?'){
        dp[0][0] = mint(4);
        dp[0][1] = dp[0][2] = mint(3);
    }else{
        dp[0][(s[0] - '0')%3] = mint(1);
    }

    rep2(i, 1, n){
        if(s[i] != '?'){
            int c = (s[i] - '0')%3;
            dp[i][c] = mint(1);
            rep(j, 3){
                int l = j-c;
                if(l < 0)l += 3;
                dp[i][j] += dp[i-1][l];
            }
            continue;
        }

        dp[i][0] = mint(4) + mint(4)*dp[i-1][0] + mint(3)*(dp[i-1][1] + dp[i-1][2]);
        dp[i][1] = mint(3) + mint(4)*dp[i-1][1] + mint(3)*(dp[i-1][2] + dp[i-1][0]);
        dp[i][2] = mint(3) + mint(4)*dp[i-1][2] + mint(3)*(dp[i-1][0] + dp[i-1][1]);
    }


    mint ans = mint(0);
    rep(i, n)ans += dp[i][0];
    cout << ans.val() << endl;

    return 0;
}