#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a,b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a,b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 998244353;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
void solve(int test_case)
{
ll n; cin >> n;
vector<string> a(n);
rep(i,n) cin >> a[i];
rep(i,n){
auto s = a[i];
reverse(all(s));
a.pb(s);
}
sort(all(a));
a.resize(unique(all(a))-a.begin());
n = sz(a);
vector<char> b;
trav(s,a){
trav(ch,s){
b.pb(ch);
}
}
sort(all(b));
b.resize(unique(all(b))-b.begin());
ll alpha = sz(b);
ll cnt[15][alpha][alpha];
memset(cnt,0,sizeof cnt);
rep(i,n){
auto &s = a[i];
ll x = lower_bound(all(b),s[0])-b.begin();
ll y = lower_bound(all(b),s.back())-b.begin();
cnt[sz(s)][x][y]++;
}
ll ans = 0;
ll dp[4][alpha][alpha];
for(int len = 3; len <= 10; ++len){
auto &f = cnt[len];
rep(sx,alpha){
rep(sy,alpha){
if(!f[sx][sy]) conts;
memset(dp,0,sizeof dp);
dp[0][sx][sy] = f[sx][sy];
rep(i,3){
rep(x,alpha){
rep(y,alpha){
rep(x2,alpha){
rep(y2,alpha){
dp[i+1][x2][y2] += dp[i][x][y]*f[x][x2]%MOD*f[y][y2]%MOD*f[x2][y2];
dp[i+1][x2][y2] %= MOD;
}
}
}
}
}
rep(x,alpha){
rep(y,alpha){
ll add = dp[3][x][y]*f[x][sx]%MOD*f[y][sy]%MOD;
ans = (ans+add)%MOD;
}
}
}
}
}
cout << ans << endl;
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
