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


#include<atcoder/modint>
using mint = atcoder::modint998244353;

mint dp[2][101][11];
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin>>n;
    string s;
    cin>>s;
    int m = 11;
    for(int i = 0;i<n;i++){
        int ni = s[i] - '0';
        for(int j = 0;j<11;j++){
            for(int l = 0;l<=9;l++){
                if(l<ni){
                    int nxt = j + l;
                    nxt = 22 - nxt;
                    nxt %= 11;
                    int ok = 121 + 2*j + l;
                    ok %= 11;
                    if(ok!=0){
                        dp[1][i+1][nxt] += dp[0][i][j];
                    }
                }else if(ni==l){
                    int nxt = j + l;
                    nxt = 22 - nxt;
                    nxt %= 11;
                    int ok = 121 + 2*j + l;
                    ok %= 11;

                    if(ok!=0){
                        dp[0][i+1][nxt] += dp[0][i][j];
                    }
                }
                int nxt = j + l;
                nxt = 22 - nxt;
                nxt %= 11;
                int ok = 121 + 2*j + l;
                ok %= 11;
                if(ok!=0){
                    dp[1][i+1][nxt] += dp[1][i][j];
                }
            }
        }
        if(i==0){
            for(int l = 1;l<ni;l++){
                int nxt = 0 + l;
                nxt = 22 - nxt;
                nxt %= 11;
                int ok = 22 - 0 + l;
                ok %= 11;
                if(ok!=0){
                    dp[1][i+1][nxt] += 1;
                }
            }
            for(int l = ni;l<=ni;l++){
                int nxt = 0 + l;
                nxt = 22 - nxt;
                nxt %= 11;
                int ok = 22 - 0 +l;
                ok %= 11;
                if(ok!=0){
                    dp[0][i+1][nxt] += 1;
                }
            }
        }else{
            for(int l = 1;l<=9;l++){
                int nxt = 0 + l;
                nxt = 22 - nxt;
                nxt %= 11;
                int ok = 22 - 0 + l;
                ok %= 11;
                if(ok!=0){
                    dp[1][i+1][nxt] += 1;
                }
            }
        }
    }
    //cout<<dp[0][n][0].val()<<" "<<dp[1][n][0].val()<<endl;
    mint ans = dp[0][n][0] + dp[1][n][0];
    cout<<ans.val()<<endl;
}