#include <bits/stdc++.h>

using i64 = long long;

constexpr int P = 998244353;
constexpr int M = 62;

int main()
{
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	std::string s; std::cin >> s;
	int n = s.size();

	std::vector<i64> cnt(M);
	i64 sum = 0, sum2 = 0;

	auto trans = [&](char c) -> int
	{
		if('a' <= c && c <= 'z') return (c - 'a');
		if('A' <= c && c <= 'Z') return 26 + (c - 'A');
		if('0' <= c && c <= '9') return 52 + (c - '0');
		return -1;
	};

	auto plus = [&](i64 &a, i64 b) -> void
	{
		a += b;
		if(a >= P) a -= P;
	};

	auto add = [&](int x) -> void
	{
		sum++;
		cnt[x]++;
		sum2 += 2 * cnt[x] - 1;
	};
	auto del = [&](int x) -> void
	{
		sum--;
		sum2 -= 2 * cnt[x] - 1;
		cnt[x]--;
	};

	auto query = [&](int x, int y) -> i64
	{
		return ((sum - cnt[x] - cnt[y]) * (sum - cnt[x] - cnt[y]) - (sum2 - cnt[x] * cnt[x] - cnt[y] * cnt[y])) / 2 % P;
	};

	for(auto c : s) add(trans(c));

	std::vector f(4, std::vector(M, std::vector<i64>(M)));
	for(int i = 0; i < M; i++) 
		for(int j = 0; j < M; j++) 
			if(i != j) f[0][i][j] = 1;

	i64 ans = 0;
	for(auto c : std::views::reverse(s))
	{
		int t = trans(c);
		del(t);

		for(int j = 0; j < M; j++) if(j != t)
		{
			plus(f[1][j][t], f[0][j][t]);
			plus(f[2][t][j], f[1][t][j]);
			plus(f[3][j][t], f[2][j][t]);

			ans = (ans + f[3][t][j] * query(t, j)) % P;
		}
	}

	std::cout << ans << "\n";

	return 0;
}