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

using mint = modint998244353;

int main() {
    string N;
    cin >> N;

    int D = N.size();
    const int M = 100;

    int n[D];
    for (int i = 0; i < D; i++) n[i] = N[i]-'0';

    mint now[2][M];
    memset(now, 0, sizeof(now));
    now[0][0] = 1;

    for (int i = 0; i < D; i++) {
        mint nxt[2][M];
        memset(nxt, 0, sizeof(nxt));
        for (int smaller = 0; smaller < 2; smaller++) {
            for (int j = 0; j < M; j++) {
                if (now[smaller][j].val() == 0) continue;
                for (int x = 0; x <= (smaller ? 9 : n[i]); x++) {
                    if (j*10+x == 404) continue;
                    nxt[smaller || x < n[i]][(j*10+x)%M] += now[smaller][j];
                }
            }
        }
        memcpy(now, nxt, sizeof(now));
    }

    mint ans = -1;
    for (auto x : now[0]) ans += x;
    for (auto x : now[1]) ans += x;
    cout << ans.val() << endl;
}