#include <bits/stdc++.h>
using namespace std;
using LL = long long;
constexpr int mod = 998244353;

void solve() {
	
	string s;
	cin >> s;

	int n = s.size();
	s = " " + s;

	auto get = [&] (char c) {
		if (c >= 'a' && c <= 'z') return c - 'a';
		else if (c >= 'A' && c <= 'Z') return c - 'A' + 26;
		else return c - '0' + 52;
	};
	auto rev = [&] (int x) {
		if (x >= 0 && x < 26) return char('a' + x);
		x -= 26;
		if (x >= 0 && x < 26) return char('A' + x);
		x -= 26;
		return char('0' + x);
 	};

	vector<int> t(n + 1);
	for (int i = 1 ; i <= n ; ++i) {
		t[i] = get(s[i]);
	}

	auto add = [&] (int &x,int y) {
		x += y;
		if (x >= mod) x -= mod;
	};	
	auto func = [&] (int x) {
		int tmp = 1LL * x * (x - 1) / 2 % mod;
		return tmp;
	};
	auto del = [&] (int &x ,int y) {
		x -= y;
		if (x < 0) x += mod;
	};

	constexpr int M = 62;
	vector<int> cnt(M) , sum(n + 1);
	vector<vector<int>> pos(M);
	vector pre(n + 1 , vector<int>(62));
	for (int i = 1 ; i <= n ; ++i) {
		for (int j = 0 ; j < M ; ++j) {
			pre[i][j] = pre[i - 1][j];
		}
		pre[i][t[i]] += 1;
		pos[t[i]].emplace_back(i);
		sum[i] = sum[i - 1];
		del(sum[i] , func(cnt[t[i]]));
		cnt[t[i]] += 1;
		add(sum[i] , func(cnt[t[i]]));
	}


	//fj

	int ans = 0 , cnt0 = 0 , cnt1 = 0;
	for (int i = 0 ; i < M ; ++i) {
		
		if (pos[i].empty()) continue;
		int m1 = pos[i].size() , k1 = m1 - 1;
		vector<int> dp(m1);
		int cnt_1_0 = 0;

		for (int j = 0 ; j < M ; ++j) {
			if (i == j || pos[j].empty()) continue;
			++cnt0;
			int cnt_0_0 = 0 , cnt_0_1 = 0;
			int m2 = pos[j].size() , k2 = m2 - 1;

			while (k1 >= 0  || k2 >= 0) {
				if (k1 >= 0 && k2 >= 0) {
					if (pos[i][k1] > pos[j][k2]) {
						add(cnt_1_0 , cnt_0_0);
						dp[k1] = cnt_0_1;
						k1 --;
					} else {
						add(cnt_0_0 , 1);
						add(cnt_0_1 , cnt_1_0);
						k2 --;
					}
				} else if (k1 >= 0) {
					add(cnt_1_0 , cnt_0_0);
					dp[k1] = cnt_0_1;
					k1 --;
				} else {
					break;
				}
			}
			
			
			int t = 0;
			for (int k = 0 ; k < m1 ; ++k) {
				int p = pos[i][k];
				int a1 = func(p - 1 - pre[p - 1][i] - pre[p - 1][j]) , a2 = sum[p - 1];
				del(a1 , a2);
				int tmp = 1LL * dp[k] * a1 % mod;
				add(t , tmp);
				dp[k] = 0;
			}
			cnt_1_0 = 0 , k1 = m1 - 1;

			add(ans , t);

		}
	}

	cout << ans << "\n";

}

int main() {

	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int t = 1;
	while (t--) {
		solve();
	}

	return 0;

}