using static System.Math; using System; class Modulo { public const int MOD = 998244353; private readonly int[] m_facs; public int Mul(int a, int b) => (int)(BigMul(a, b) % MOD); public Modulo(int n) { m_facs = new int[n + 1]; m_facs[0] = 1; for (int i = 1; i <= n; ++i) m_facs[i] = Mul(m_facs[i - 1], i); } public int Fac(int n) => m_facs[n]; public int Pow(int a, int m) { switch (m) { case 0: return 1; case 1: return a; default: int p1 = Pow(a, m / 2); int p2 = Mul(p1, p1); return ((m % 2) == 0) ? p2 : Mul(p2, a); } } public int Div(int a, int b) => Mul(a, Pow(b, MOD - 2)); public int Ncr(int n, int r) { if (n < r) return 0; if (n == r) return 1; int res = Fac(n); res = Div(res, Fac(r)); res = Div(res, Fac(n - r)); return res; } } public class Hello { static void Main() { var s = Console.ReadLine().Trim(); getAns(s); } static void getAns(string s) { var a = new int[10]; foreach (var x in s) a[x - '0']++; var n = s.Length; var md = new Modulo(n); if (a[0] == 0) { long ans = md.Fac(n); for (int i = 1; i < 10; i++) { if (a[i] > 1) { var tt = md.Fac(a[i]); ans = md.Div((int)ans, tt); } } Console.WriteLine(ans); } else { long ans = (n - a[0]); ans *= md.Fac(n - 1); ans %= Modulo.MOD; for (int i = 0; i < 10; i++) { if (a[i] > 1) { var tt = md.Fac(a[i]); ans = md.Div((int)ans, tt); } } Console.WriteLine(ans); } } }