#include #include #include #include template struct ModInt { using lint = long long; int val; // constructor ModInt(lint v = 0) : val(v % MOD) { if (val < 0) val += MOD; }; // unary operator ModInt operator+() const { return ModInt(val); } ModInt operator-() const { return ModInt(MOD - val); } ModInt inv() const { return this->pow(MOD - 2); } // arithmetic ModInt operator+(const ModInt& x) const { return ModInt(*this) += x; } ModInt operator-(const ModInt& x) const { return ModInt(*this) -= x; } ModInt operator*(const ModInt& x) const { return ModInt(*this) *= x; } ModInt operator/(const ModInt& x) const { return ModInt(*this) /= x; } ModInt pow(lint n) const { auto x = ModInt(1); auto b = *this; while (n > 0) { if (n & 1) x *= b; n >>= 1; b *= b; } return x; } // compound assignment ModInt& operator+=(const ModInt& x) { if ((val += x.val) >= MOD) val -= MOD; return *this; } ModInt& operator-=(const ModInt& x) { if ((val -= x.val) < 0) val += MOD; return *this; } ModInt& operator*=(const ModInt& x) { val = lint(val) * x.val % MOD; return *this; } ModInt& operator/=(const ModInt& x) { return *this *= x.inv(); } // compare bool operator==(const ModInt& b) const { return val == b.val; } bool operator!=(const ModInt& b) const { return val != b.val; } bool operator<(const ModInt& b) const { return val < b.val; } bool operator<=(const ModInt& b) const { return val <= b.val; } bool operator>(const ModInt& b) const { return val > b.val; } bool operator>=(const ModInt& b) const { return val >= b.val; } // I/O friend std::istream& operator>>(std::istream& is, ModInt& x) noexcept { lint v; is >> v; x = v; return is; } friend std::ostream& operator<<(std::ostream& os, const ModInt& x) noexcept { return os << x.val; } }; template struct Combination { int max_n; std::vector f, invf; explicit Combination(int n) : max_n(n), f(n + 1), invf(n + 1) { f[0] = 1; for (int i = 1; i <= n; ++i) { f[i] = f[i - 1] * i; } invf[max_n] = f[max_n].inv(); for (int i = max_n - 1; i >= 0; --i) { invf[i] = invf[i + 1] * (i + 1); } } T fact(int n) const { return n < 0 ? T(0) : f[n]; } T invfact(int n) const { return n < 0 ? T(0) : invf[n]; } T perm(int a, int b) const { return a < b || b < 0 ? T(0) : f[a] * invf[a - b]; } T binom(int a, int b) const { return a < b || b < 0 ? T(0) : f[a] * invf[a - b] * invf[b]; } }; template struct NumberTheoreticalTransform { using mint = ModInt; using mints = std::vector; std::vector zetas; explicit NumberTheoreticalTransform() { int exp = MOD - 1; while (true) { mint zeta = mint(Root).pow(exp); zetas.push_back(zeta); if (exp % 2 != 0) break; exp /= 2; } } void bitrev(mints& f) const { int n = f.size(); for (int i = 0; i < n; ++i) { int ti = i, ni = 0; for (int k = 0; (1 << k) < n; ++k) { int b = (ti & 1); ti >>= 1; ni <<= 1; ni += b; } if (i < ni) std::swap(f[i], f[ni]); } } void ufft(mints& f, bool isinv) const { int n = f.size(); int h = 0; while ((1 << h) < n) ++h; for (int b = n; b > 1; b >>= 1, --h) { auto zeta = zetas[h]; if (isinv) zeta = zeta.inv(); mint zetapow = 1; for (int i = 0; i < b / 2; ++i) { for (int j = i; j < n; j += b) { auto l = f[j], r = f[j + b / 2]; f[j] = l + r; f[j + b / 2] = (l - r) * zetapow; } zetapow *= zeta; } } } void fft(mints& f, bool isinv) const { ufft(f, isinv); bitrev(f); if (isinv) { auto ninv = mint(f.size()).inv(); for (auto& x : f) x *= ninv; } } mints convolute(mints f, mints g) const { int fdeg = f.size(), gdeg = g.size(); int k = 0; while ((1 << k) < fdeg + gdeg) ++k; int n = (1 << k); f.resize(n, mint(0)); g.resize(n, mint(0)); fft(f, false); fft(g, false); for (int i = 0; i < n; ++i) f[i] *= g[i]; fft(f, true); f.resize(fdeg + gdeg - 1); return f; } }; constexpr int MOD = 998244353; using mint = ModInt; const Combination C(300000); const NumberTheoreticalTransform NTT; void solve() { std::string s; std::cin >> s; std::vector cnt(26, 0); for (char c : s) ++cnt[c - 'a']; std::vector f{1}; for (auto d : cnt) { std::vector g(d + 1); for (int i = 0; i <= d; ++i) g[i] = C.invfact(i); f = NTT.convolute(f, g); } mint ans = 0; for (int i = 1; i < (int)f.size(); ++i) { ans += f[i] * C.fact(i); } std::cout << ans << "\n"; } int main() { std::cin.tie(nullptr); std::ios::sync_with_stdio(false); solve(); return 0; }