#include<bits/stdc++.h>
using namespace std;
#include<atcoder/math>
using namespace atcoder;

#define rep(i, a, b) for (int i = a; i < b; i++)
using ll = long long;

int main(){
	string s;
	cin >> s;
	int N = s.size(), ma = 2e5;
	ll MOD = 998244353;
	vector<ll> fac(ma + 1), ifac(ma + 1);
	fac[0] = 1;
	rep(i, 1, ma + 1) fac[i] = fac[i - 1] * i % MOD;
	ifac[ma] = inv_mod(fac[ma], MOD);
	for(int i = ma; i > 0; i--) ifac[i - 1] = ifac[i] * i % MOD;
	auto g = [&](int n, int k) {
		if (n < k || k < 0) return 0LL;
		return fac[n] * ifac[k] % MOD * ifac[n - k] % MOD;
	};
	map<int, int> mp;
	rep(i, 0, N) {
		mp[s[i] - '0']++;
	}
	ll ans = 1;
	for(auto it = mp.begin(); it != mp.end(); it++) {
		int f = it->first;
		int s = it->second;
		if (f) ans = ans * g(N, s) % MOD;
		else ans = ans * g(N - 1, s) % MOD;
		N -= s;
	}
	cout << ans << endl;
}