#include <iostream>
#include <vector>
#include <string>
using namespace std;

const long long MOD = 998244353;

long long digit_dp(const string& s) {
    vector<int> ds;
    for (char c : s) ds.push_back(c - '0');
    int nd = ds.size();

    // dp[i][j][k][m]
    // i : i 桁目までみた
    // j : n 未満か(j=0 完全一致 j=1 より小さい)
    // k : leading zero
    // m : 各数字の頻度の偶奇（ビットで表現）
    vector<vector<vector<vector<long long>>>> dp(
        nd + 1,
        vector<vector<vector<long long>>>(
            2,
            vector<vector<long long>>(
                2,
                vector<long long>(1 << 10, 0)
            )
        )
    );

    dp[0][0][1][0] = 1;

    for (int i = 0; i < nd; ++i) {
        for (int j = 0; j < 2; ++j) {
            int to = (j == 0) ? ds[i] : 9;
            for (int k = 0; k < 2; ++k) {
                for (int m = 0; m < (1 << 10); ++m) {
                    long long cur = dp[i][j][k][m];
                    if (cur == 0) continue;
                    for (int x = 0; x <= to; ++x) {
                        int nj = j | (x < to);
                        int nk = k & (x == 0);
                        int nm = nk ? m : (m ^ (1 << x));
                        dp[i + 1][nj][nk][nm] += cur;
                        if (dp[i + 1][nj][nk][nm] >= MOD)
                            dp[i + 1][nj][nk][nm] -= MOD;
                    }
                }
            }
        }
    }

    long long res = (dp[nd][0][0][0] + dp[nd][1][0][0]) % MOD;
    return res;
}

int main() {
    string N;
    cin >> N;
    cout << digit_dp(N) << endl;
    return 0;
}