#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(p) p.begin(),p.end()
#define rep(i,a,b) for(int i=(int)a;i<(int)b;i++)
const int mod=998244353;

int main(){
	int N;
	cin>>N;
	string X;
	cin>>X;
	int M=11;
	vector<ll> dp(M);
	int val=0,ok=1;
	rep(i,0,N){
		vector<ll> n_dp(M);
		if(i) dp[0]++;
		rep(j,0,M) rep(k,0,10){
			if((2*j-k+M)%M==0) continue;
			n_dp[(k-j+M)%M]+=dp[j];
		}
		rep(k,0,X[i]-'0'){
			if((2*val-k+M)%M==0) continue;
			n_dp[(k-val+M)%M]+=ok;
		}
		int n=X[i]-'0';
		if((2*val-n+M)%M==0) ok=0;
		val=((int)(X[i]-'0')+M-val)%M;
		swap(n_dp,dp);
		for(auto &x:dp) x%=mod;
	}
	ll ans=dp[0];
	if(val==0) ans+=ok;
	cout<<ans%mod<<"\n";
}