// ~~ icebear ~~
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
template<class T>
bool minimize(T &a, const T &b) {
if (a > b) return a = b, true;
return false;
}
template<class T>
bool maximize(T &a, const T &b) {
if (a < b) return a = b, true;
return false;
}
#define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
#define FORR(i,a,b) for(int i=(a); i>=(b); --i)
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RED(i, n) for(int i=(n)-1; i>=0; --i)
#define MASK(i) (1LL << (i))
#define BIT(S, i) (((S) >> (i)) & 1)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define task "icebear"
/*END OF TEMPLATE. ICEBEAR AND THE CAT WILL WIN VOI26 */
const int MOD = 998244353;
const int inf = 1e9 + 27092008;
const ll INF = 1e18 + 27092008;
const int N = 2e5 + 5;
int n;
int cnt[15][256][256];
set<string> S;
void add(int &x, int y) {
x += y;
if (x >= MOD) x -= MOD;
}
void init(void) {
cin >> n;
FOR(i, 1, n) {
string s; cin >> s;
if (S.find(s) != S.end()) continue;
cnt[(int)s.size()][s[0]][s.back()]++;
S.insert(s);
reverse(all(s));
if (S.find(s) == S.end()) {
S.insert(s);
cnt[(int)s.size()][s[0]][s.back()]++;
}
}
}
void process(void) {
int ans = 0;
FOR(l, 3, 10) FOR(a, 'a', 'f') FOR(b, 'a', 'f') FOR(c, 'a', 'f') FOR(d, 'a', 'f') FOR(e, 'a', 'f') FOR(f, 'a', 'f') FOR(g, 'a', 'f') FOR(h, 'a', 'f') {
vector<int> v({
cnt[l][a][b], cnt[l][b][c], cnt[l][c][d], cnt[l][d][a],
cnt[l][e][a], cnt[l][f][b], cnt[l][g][c], cnt[l][h][d],
cnt[l][e][f], cnt[l][f][g], cnt[l][g][h], cnt[l][h][e]
});
int mul = 1;
for(int x : v) mul = 1LL * mul * x % MOD;
add(ans, mul);
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if (fopen(task".inp", "r")) {
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
int tc = 1;
// cin >> tc;
while(tc--) {
init();
process();
}
return 0;
}
