#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int MOD = 1000000007;
const int MOD = 998244353;
struct mint {
	ll x;
	mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
	mint operator-() { return mint(-x); }
	mint operator+=(mint rhs) {
		x += rhs.x;
		if (x >= MOD) x -= MOD;
		return *this;
	}
	mint operator-=(mint rhs) {
		x -= rhs.x;
		if (x < 0) x += MOD;
		return *this;
	}
	mint operator*=(mint rhs) {
		x = x * rhs.x % MOD;
		return *this;
	}
	mint operator+(mint rhs) { return mint(*this) += rhs; }
	mint operator-(mint rhs) { return mint(*this) -= rhs; }
	mint operator*(mint rhs) { return mint(*this) *= rhs; }
	mint pow(ll n) {
		mint r = 1;
		for (mint t = (*this); n; t *= t, n >>= 1)
			if (n & 1) r *= t;
		return r;
	}
	mint inv() { return (*this).pow(MOD - 2); }
	mint operator/=(mint rhs) { return *this *= rhs.inv(); }
	mint operator/(mint rhs) { return mint(*this) /= rhs; }
};
ostream &operator<<(ostream &os, const mint &dt) {
	os << dt.x;
	return os;
}
struct comb {
	vector<mint> fact, finv, inv;
	comb(int n) : fact(n + 1), finv(n + 1), inv(n + 1) {
		fact[0] = finv[0] = inv[1] = fact[1] = finv[1] = 1;
		for (int i = 2; i < n; i++) {
			fact[i] = fact[i - 1] * i;
			inv[i] = -inv[MOD % i] * (MOD / i);
			finv[i] = finv[i - 1] * inv[i];
		}
	}
	mint c(ll n, ll r) {
		if (n < r || n < 0 || r < 0) return 0;
		return fact[n] * finv[r] * finv[n - r];
	}
};
int main() {
	string n;
	cin >> n;
	vector<int> cnt(10, 0);
	for (char c : n) {
		cnt[c - '0']++;
	}
	comb c((int)n.size() + 10);
	auto f = [&]() {
		mint res = 1;
		int tot = 0;
		for (int i = 0; i < 10; i++) {
			res /= c.fact[cnt[i]];
			tot += cnt[i];
		}
		res *= c.fact[tot];
		return res;
	};
	mint ans = f();
	if (cnt[0] >= 1) {
		cnt[0]--;
		ans -= f();
	}
	cout << ans << endl;
	return 0;
}