#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 998244353;
const int N = 200005;
const int INF = 0x3f3f3f3f;
ll powmod(ll x, ll y) {
    ll res = 1;
    while (y) {
        if (y & 1) res = res * x % mod;
        y >>= 1;
        x = x * x % mod;
    }
    return res;
}
ll fac[N], inv[N], jv[N];
void com_init(int n) {
    inv[1] = 1;
    for (int i = 2; i <= n; i++) inv[i] = (mod - mod / i) * inv[mod % i] % mod;
    jv[0] = fac[0] = 1;
    for (int i = 1; i <= n; i++) {
        fac[i] = fac[i - 1] * i % mod;
        jv[i] = jv[i - 1] * inv[i] % mod;
    }
}
ll com(ll n, ll m) {
    if (n < m || m < 0) return 0;
    return fac[n] * jv[n - m] % mod * jv[m] % mod;
}
int cnt[N];
ll solve() {
    int tot = 0;
    for (int i = 0; i < 10; i++) tot += cnt[i];
    ll res = fac[tot];
    for (int i = 0; i < 10; i++) res = res * jv[cnt[i]] % mod;
    return res;
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    com_init(N - 5);
    string s;
    cin >> s;
    for (auto x : s) cnt[x - '0']++;
    ll res = solve();
    if (cnt[0] > 0) {
        cnt[0]--;
        res = (res - solve() + mod) % mod;
    }
    cout << res << "\n";
    return 0;
}