#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;
using mint = modint998244353;
using vm = vector<mint>;

int main() {
	lint N;
	string S;
	cin >> N >> S;

	lint a=0, b=0, c=0, x, y, z;
	std::vector<vm> dp(N+1, vm(3));
	dp[0][0] = 1;
	rep(i, N) {
		if (S[i] == '?') {
			rep(j, 10) {
				if (i) dp[i+1][j%3]++;
				rep(k, 3) {
					dp[i+1][(j+k)%3] += dp[i][k];
				}
			}
		} else {
			x = S[i]-'0';
			if (i) dp[i+1][x%3]++;
			rep(k, 3) {
				dp[i+1][(x+k)%3] += dp[i][k];
			}
		}
	}
	mint ans = 0;
	repx(i, 1, N+1) {
		ans += dp[i][0];
		// rep(j, 3) {
		// 	std::cout << dp[i][j].val() << '\n';
		// }
	}
	std::cout << ans.val() << '\n';
}