#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 998244353;
ll words[11][65][65];
ll trip[11][65][65][65];
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//random_start();
int n;
cin >> n;
vector<pair<string,pair<int,pii>>> vw;
set<pair<string,pair<int,pii>>> sw;
map<char,int> m;
rep(i,n)
{
string s;
cin >> s;
int len = siz(s);
char p = s[0];
char k = s[len-1];
vw.pb({s,{len,{p,k}}});
reverse(all(s));
vw.pb({s,{len,{k,p}}});
m[p]++;
m[k]++;
}
int cur = 0;
forall(it,m)
{
m[it.ff] = cur++;
}
forall(it,vw)
{
// cout << it.ff << " " << it.ss.ff << " " << it.ss.ss.ff << " " << it.ss.ss.ss << " it\n";
sw.insert({it.ff,{it.ss.ff,{m[it.ss.ss.ff],m[it.ss.ss.ss]}}});
}
forall(it,sw)
{
words[it.ss.ff][it.ss.ss.ff][it.ss.ss.ss]++;
}
ll ans = 0;
rep2(len,3,10)
{
rep(a,cur)
{
rep(b,cur)
{
rep(c,cur)
{
rep(d,cur)
{
trip[len][a][b][c] += (words[len][a][d] * words[len][b][d] * words[len][c][d]) % MOD;
}
trip[len][a][b][c] %= MOD;
}
}
}
}
rep2(len,3,10)
{
rep(a,cur)
{
rep(b,cur)
{
rep(c,cur)
{
rep(d,cur)
{
ans += (((((trip[len][a][b][c] * trip[len][a][b][d]) % MOD) * trip[len][c][d][a]) % MOD) * trip[len][c][d][b]) % MOD;
}
}
}
}
}
ans %= MOD;
cout << ans << "\n";
}
