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

using Mint = atcoder::modint998244353;
using namespace std;

Mint F(int N)
{
    Mint a = 1;
    for (int i = 1; i <= N; ++i)
        a *= i;
    return a;
}

Mint solve(vector<int> C)
{
    Mint ans = F(accumulate(C.begin(), C.end(), 0));
    for (int i = 0; i < 10; ++i)
        ans /= F(C[i]);
    return ans;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    string S;
    cin >> S;
    vector<int> C(10);
    for (char c : S)
        C[c - '0']++;

    Mint ans = solve(C);

    if (C[0] > 0)
    {
        --C[0];
        ans -= solve(C);
    }

    cout << ans.val() << endl;
}