#include <bits/stdc++.h>
using namespace std; 
typedef long long i64; 
const int P = 998244353; 
const int N = 2e5 + 5; 

inline int trans(char c) {
    if (c >= 'a' && c <= 'z') return c - 'a'; 
    if (c >= 'A' && c <= 'Z') return c - 'A' + 26; 
    return c + 52; 
}

int n, cnt[15]; 
i64 g[15][62][62], f[62][62][62]; 
string s[N]; 

int main(void) {
    ios::sync_with_stdio(0); cin.tie(0); 
    cin >> n; 
    for (int i = 1; i <= n; ++i) 
        cin >> s[i], s[i + n] = s[i], reverse(s[i].begin(), s[i].end()); 
    n *= 2; 
    sort(s + 1, s + n + 1); 
    n = unique(s + 1, s + n + 1) - s - 1; 
    for (int i = 1; i <= n; ++i) {
        ++cnt[s[i].size()]; 
        ++g[s[i].size()][trans(s[i][0])][trans(s[i].back())]; 
    }
    i64 ans = 0; 
    for (int len = 3; len <= 10; ++len) if (cnt[len]) {
        memset(f, 0, sizeof f); 
        for (int i = 0; i < 62; ++i) for (int x = 0; x < 62; ++x) if (g[len][i][x]) for (int y = 0; y < 62; ++y) if (g[len][i][y]) for (int z = 0; z < 62; ++z)
            f[x][y][z] = (f[x][y][z] + g[len][i][x] * g[len][i][y] % P * g[len][i][z]) % P; 
        for (int i = 0; i < 62; ++i) for (int x = 0; x < 62; ++x) for (int y = 0; y < 62; ++y) if (f[i][x][y]) for (int z = 0; z < 62; ++z)
            ans = (ans + f[x][y][z] * f[i][x][y] % P * f[i][y][z] % P * f[i][x][z]) % P; 
    }
    cout << ans << "\n"; 

    return 0;
}