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

using namespace std;
using namespace atcoder;
using ll = int;

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

using mint = modint998244353;

int main()
{
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    // cout << fixed << setprecision(18);

    string s;
    cin>>s;
    ll n = s.size();
    vector<vector<vector<vector<mint>>>> dp(n+1, vector<vector<vector<mint>>>(1<<10, vector<vector<mint>>(2, vector<mint>(2))));
    dp[n][0][1][1] = 1;
    rrep(i,n,1){
        ll now = s[n-i]-'0';
        rep(j,0,1<<10){
            rep(mode,0,2){
                rep(l,0,2){
                    if (mode){
                        rep(k,0,10){
                            if (l){
                                if (k<now){
                                    if (k==0){
                                        dp[i-1][j][0][1] += dp[i][j][mode][l];
                                    }else{
                                        dp[i-1][j^(1<<k)][0][0] += dp[i][j][mode][l];
                                    }
                                }else if(k==now){
                                    dp[i-1][j^(1<<k)][1][0] += dp[i][j][mode][l];
                                }
                            }else{
                                if (k<now){
                                    dp[i-1][j^(1<<k)][0][0] += dp[i][j][mode][l];
                                }else if(k==now){
                                    dp[i-1][j^(1<<k)][1][0] += dp[i][j][mode][l];
                                }
                            }
                        }
                    }else{
                        rep(k,0,10){
                            if (l){
                                if (k==0){
                                    dp[i-1][j][0][1] += dp[i][j][mode][l];
                                }else{
                                    dp[i-1][j^(1<<k)][0][0] += dp[i][j][mode][l];
                                }
                            }else{
                                dp[i-1][j^(1<<k)][0][0] += dp[i][j][mode][l];
                            }
                        }
                    }
                }

            }
        }
    }
    mint ans = dp[0][0][0][0] + dp[0][0][1][0];
    cout << ans.val() << endl;

    return 0;
}