#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)

ll modPow(long long a, long long n, long long p) {
    if (n == 0) return 1; // 0乗にも対応する場合
    if (n == 1) return a % p;
    if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
    long long t = modPow(a, n / 2, p);
    return (t * t) % p;
}

ll phi(ll N) {
    ll res = N;
    for (ll i = 2; i * i <= N; i++) {
        if (N % i == 0) {
            res -= res / i;
            while (N % i == 0)N /= i;
        }
    }
    if (N != 1)res -= res / N;
    return res;
}

vector<ll> fact, factinv, inv;
ll mod = 998244353;
void prenCkModp(ll n) {
    fact.resize(n + 5);
    factinv.resize(n + 5);
    inv.resize(n + 5);
    fact.at(0) = fact.at(1) = 1;
    factinv.at(0) = factinv.at(1) = 1;
    inv.at(1) = 1;
    for (ll i = 2; i < n + 5; i++) {
        fact.at(i) = (fact.at(i - 1) * i) % mod;
        inv.at(i) = mod - (inv.at(mod % i) * (mod / i)) % mod;
        factinv.at(i) = (factinv.at(i - 1) * inv.at(i)) % mod;
    }

}
ll nCk(ll n, ll k) {
    if (n < k) return 0;
    return fact.at(n) * (factinv.at(k) * factinv.at(n - k) % mod) % mod;
}
int main() {
    string S;
    cin >> S;
    vector<vll> DP(27, vll(6001, 0));
    vll C(26, 0);
    rep(i, S.size()) {
        C[S[i] - 'a']++;
    }
    rep(i, C[0] + 1)DP[0][i]++;
    prenCkModp(100000);
    rep(i, 25) {
        rep(j, C[i + 1] + 1) {
            rep(k, 5001) {
                ll d = DP[i][k];
                ll q = nCk(k + j, j);
                DP[i + 1][k + j] += (d * q) % mod;
                DP[i + 1][k + j] %= mod;
            }
        }
    }
    ll an = 0;
    rep(i, 5001)an += DP[25][i+1];
    cout << an%mod << endl;
}