#include <bits/stdc++.h>
#include <atcoder/modint>

using namespace std;

#define rep(i, a, b) for(int i=a; i<b; i++)
#define rrep(i, a, b) for(int i=a; i>=b; i--)

using mint = atcoder::modint998244353;

int main()
{
    string s;
    cin >> s;
    int n = s.size();
    
    // dpの次元を削減しながらメモリ使用量を減らす
    vector<vector<vector<mint>>> dp(1<<10, vector<vector<mint>>(2, vector<mint>(2)));
    dp[0][1][1] = 1;

    rrep(i, n, 1) {
        int now = s[n - i] - '0';
        vector<vector<vector<mint>>> new_dp(1<<10, vector<vector<mint>>(2, vector<mint>(2)));
        
        rep(j, 0, 1<<10) {
            rep(mode, 0, 2) {
                rep(l, 0, 2) {
                    if (mode) {
                        if (l) {
                            rep(k, 0, now + 1) {
                                if (k == 0) new_dp[j][0][1] += dp[j][mode][l];
                                else if (k < now) new_dp[j^(1<<k)][0][0] += dp[j][mode][l];
                                else new_dp[j^(1<<k)][1][0] += dp[j][mode][l];
                            }
                        } else {
                            rep(k, 0, now + 1) {
                                if (k < now) new_dp[j^(1<<k)][0][0] += dp[j][mode][l];
                                else new_dp[j^(1<<k)][1][0] += dp[j][mode][l];
                            }
                        }
                    } else {
                        if (l) {
                            rep(k, 0, 10) {
                                if (k == 0) new_dp[j][0][1] += dp[j][mode][l];
                                else new_dp[j^(1<<k)][0][0] += dp[j][mode][l];
                            }
                        } else {
                            rep(k, 0, 10) {
                                new_dp[j^(1<<k)][0][0] += dp[j][mode][l];
                            }
                        }
                    }
                }
            }
        }
        
        dp.swap(new_dp);  // 新しいdpに更新
    }
    
    mint ans = dp[0][0][0] + dp[0][1][0];
    cout << ans.val() << endl;

    return 0;
}