#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC target("popcnt")
using namespace std;
using ll = long long;
using ull = unsigned long long;
using lld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using ii = pair<int,int>;
using pll = pair<ll, ll>;
using vii = vector<ii>;
using vpll = vector<pll>;
#define endl '\n'
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define gcd(a,b) __gcd(a,b)
#define sz(x) (int)x.size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fls cout.flush()
#define fore(i,l,r) for(auto i=l;i<r;i++)
#define fo(i,n) fore(i,0,n)
#define forex(i,r,l) for(auto i=r; i>=l;i--)
#define ffo(i,n) forex(i,n-1,0)
bool cmin(int &a, int b){if(b<a){a=b;return 1;}return 0;}
bool cmax(int &a, int b){if(b>a){a=b;return 1;}return 0;}
void valid(ll in){cout<<((in)?"YES\n":"NO\n");}
ll lcm(ll a, ll b){return (a/gcd(a,b))*b;}
ll gauss(ll n){return (n*(n+1))/2;}
const int N =1e5+7,mod= 998244353;
string s[N];
vi act;
ll n,ans=0;
set<string> st[6][6][11];
void solve(int i){
if(i==8){
fore(tam, 3, 11){
ll aux=1;
fo(i,4)aux=(aux*sz(st[act[i]][act[(i+1)%4]][tam]))%mod;
fo(i,4)aux=(aux*sz(st[act[i]][act[i+4]][tam]))%mod;
fo(i,4)aux=(aux*sz(st[act[i+4]][act[(i+1)%4+4]][tam]))%mod;
ans=(ans+aux)%mod;
}
return;
}
fo(v, 6){
act.pb(v);
solve(i+1);
act.pop_back();
}
}
void test_case(){
cin>>n;
fo(i,n){
cin>>s[i];
st[s[i][0]-'a'][s[i].back()-'a'][sz(s[i])].insert(s[i]);
reverse(all(s[i]));
st[s[i][0]-'a'][s[i].back()-'a'][sz(s[i])].insert(s[i]);
}
solve(0);
cout<<ans<<endl;
}
int main(){cin.tie(0)->sync_with_stdio(0);
int t=1;
// cin >> t;
while(t--)test_case();
}
