#include<bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using mint = atcoder::modint998244353;

const int MAX = 510000;
mint fac[MAX], finv[MAX], inv[MAX];

// テーブルを作る前処理
void COMinit() {
    const int MOD = mint::mod();
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i;
        inv[i] = MOD - inv[MOD%i] * (MOD / i);
        finv[i] = finv[i - 1] * inv[i];
    }
}

// 二項係数計算
mint COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * finv[k] * finv[n - k];
}

int main() {
    // 前処理
    COMinit();
    string S;
    cin >> S;
    int N = S.size();
    vector<int> a(10);
    for(auto c : S){
    	int n = c - '0';
    	a[n]++;
    }
    
    mint ans = 1;
    
    for(int i = 0; i <= 9; i++){
    	if(i == 0)
    		ans *= COM(N-1,a[i]);
    	else
    		ans *= COM(N,a[i]);
    		
		N -= a[i];
    }
    
    cout << ans.val() << endl;
}