#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 998244353;
const int MAX = 200005;

ll fact[MAX], inv_fact[MAX];
ll modpow(ll a, ll b) {
    ll res = 1;
    while (b > 0) {
        if (b & 1) res = res * a % MOD;
        a = a * a % MOD;
        b >>= 1;
    }
    return res;
}

void prepare_factorials() {
    fact[0] = inv_fact[0] = 1;
    for (int i = 1; i < MAX; ++i) {
        fact[i] = fact[i - 1] * i % MOD;
        inv_fact[i] = modpow(fact[i], MOD - 2);
    }
}
ll multinomial(const vector<int>& freq, int total_digits) {
    ll res = fact[total_digits];
    for (int f : freq) {
        res = res * inv_fact[f] % MOD;
    }
    return res;
}

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

    prepare_factorials();

    vector<int> freq(10, 0);
    for (char c : N) freq[c - '0']++;

    int total_digits = N.size();

    ll total = multinomial(freq, total_digits);

    if (freq[0] > 0) {
        freq[0]--; 
        ll bad = multinomial(freq, total_digits - 1);
        total = (total - bad + MOD) % MOD;
    }

    cout << total << endl;
    return 0;
}