#include<bits/stdc++.h>
#include<atcoder/modint>
using namespace std;
using mint = atcoder::modint998244353;

int main(){
    int n; cin >> n;
    string s; cin >> s;
    vector<vector<mint>> dp(n+1,vector<mint>(23,0));
    auto mod11 = [&](int a){
        return (a % 11 + 11) % 11;
    };
    dp[0][22] = 1;
    for (int i = 0; i < n; i++){
        int dig = s[i] - '0';
        for (int m = 0; m < 11; m++){
            for (int d = 0; d <= dig; d++){
                int p = d * (i % 2 == 0 ? 1 : -1);
                if (mod11(2*m+p) == 0) continue;
                int nxt = mod11(m+p);
                if (d < dig) nxt += 11;
                dp[i+1][nxt] += dp[i][m];
            }
        }
        for (int m = 11; m < 22; m++){
            for (int d = 0; d < 10; d++){
                int p = d * (i % 2 == 0 ? 1 : -1);
                if (mod11(2*m+p) == 0) continue;
                int nxt = mod11(m+p)+11;
                dp[i+1][nxt] += dp[i][m];
            }
        }
        if (i == 0){
            for (int d = 0; d <= dig; d++){
                int p = d * (i % 2 == 0 ? 1 : -1);
                if (d == 0){
                    dp[i+1][22] += dp[i][22];
                    continue;
                }
                if (mod11(p) == 0) continue;
                int nxt = mod11(p);
                if (d < dig) nxt += 11;
                dp[i+1][nxt] += dp[i][22];
            }
        }
        else {
            for (int d = 0; d < 10; d++){
                int p = d * (i % 2 == 0 ? 1 : -1);
                if (d == 0){
                    dp[i+1][22] += dp[i][22];
                    continue;
                }
                if (mod11(p) == 0) continue;
                int nxt = mod11(p)+11;
                dp[i+1][nxt] += dp[i][22];
            }
        }
    }
    mint ans = dp[n][0] + dp[n][11];
    cout << ans.val() << endl;
}