#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;
const int mod = 998244353;

int n, ans, cnt[15][62][62], sum[62][62][62];
string str[N * 2];

int tr(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;
    }
}

int main() {

    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> str[i];
        str[i + n] = str[i];
        reverse(str[i + n].begin(), str[i + n].end());
    }
    sort(str + 1, str + n * 2 + 1);
    n = unique(str + 1, str + n * 2 + 1) - str - 1;
    for (int i = 1; i <= n; i++) {
        cnt[str[i].size()][tr(str[i].front())][tr(str[i].back())]++;
    }
    for (int l = 3; l <= 10; l++) {
        for (int a = 0; a < 62; a++) {
            for (int b = 0; b < 62; b++) {
                for (int c = 0; c < 62; c++) {
                    sum[a][b][c] = 0;
                    for (int d = 0; d < 62; d++) {
                        sum[a][b][c] =
                            (sum[a][b][c] + 1ll * cnt[l][a][d] * cnt[l][b][d] % mod * cnt[l][c][d] % mod) %
                            mod;
                    }
                }
            }
        }
        for (int a = 0; a < 62; a++) {
            for (int b = 0; b < 62; b++) {
                for (int c = 0; c < 62; c++) {
                    for (int d = 0; d < 62; d++) {
                        ans = (ans + 1ll * sum[a][b][c] * sum[a][b][d] % mod * sum[a][c][d] % mod *
                                         sum[b][c][d] % mod) %
                              mod;
                    }
                }
            }
        }
    }
    cout << ans << '\n';

    return 0;
}