#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

#include "atcoder/modint"

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

using mint = atcoder::modint998244353;

const int MAX_N = 102, D = 11;
mint dp[MAX_N][1 << D][D][2][2];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;
    string X;
    cin >> N >> X;
    dp[0][0][0][1][0] = 1;
    for (int i = 0; i < N; i++) {
        int x = X[i] - '0';
        for (int mask = 0; mask < 1 << D; mask++) {
            for (int j = 0; j < D; j++) {
                for (int k = 0; k < 2; k++) {
                    for (int l = 0; l < 2; l++) {
                        mint& val = dp[i][mask][j][k][l];
                        if (val == 0) continue;
                        for (int d = 0; d < 10; d++) {
                            if (k == 1 and x < d) continue;
                            int nmask = 0, nj = (j + (i & 1 ? d : D - d)) % D, nk = k, nl = l;
                            if (k == 1 and d < x) nk = 0;
                            if (l == 0 and d > 0) nl = 1;
                            for (int m = 0; m < D; m++) {
                                if (mask >> m & 1) {
                                    int nm = (m + (i & 1 ? D - d : d)) % D;
                                    nmask |= 1 << nm;
                                }
                            }
                            if (nl == 1) nmask |= 1 << j;
                            dp[i + 1][nmask][nj][nk][nl] += val;
                        }
                    }
                }
            }
        }
    }

    mint ans = 0;
    for (int mask = 0; mask < 1 << D; mask++) {
        for (int k = 0; k < 2; k++) {
            if (~mask & 1) {
                ans += dp[N][mask][0][k][1];
            }
        }
    }

    cout << ans.val() << '\n';
    return 0;
}