#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
string S;
ll from[3][3],to[3][3];
const ll mo=998244353;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>S;
	from[0][0]=1;
	FOR(i,N) {
		ZERO(to);
		to[0][0]=1;
		to[2][0]=from[2][0];
		to[2][1]=from[2][1];
		to[2][2]=from[2][2];
		FOR(j,10) {
			if(S[i]!='?'&&S[i]!='0'+j) continue;
			(to[1][j%3]+=from[0][0])%=mo;
			(to[2][j%3]+=from[0][0])%=mo;
			(to[1][j%3]+=from[1][0])%=mo;
			(to[1][(10+j)%3]+=from[1][1])%=mo;
			(to[1][(20+j)%3]+=from[1][2])%=mo;
			(to[2][j%3]+=from[1][0])%=mo;
			(to[2][(10+j)%3]+=from[1][1])%=mo;
			(to[2][(20+j)%3]+=from[1][2])%=mo;
		}
		swap(from,to);
	}
	
	cout<<(from[2][0])%mo<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}