Problem: A cubeword is a special type of a crossword. When building a cubeword, you start by choosing a positive integer a: the side length of the cube. Then, you build a big cube consisting of a × a × a unit cubes. This big cube has 12 edges. Then, you discard all unit cubes that do not touch the edges of the big cube. The figure below shows the object you will get for a=6.

<image>

Finally, you assign a letter to each of the unit cubes in the object. You must get a meaningful word along each edge of the big cube. Each edge can be read in either direction, and it is sufficient if one of the two directions of reading gives a meaningful word.

The figure below shows the object for a=6 in which some unit cubes already have assigned letters. You can already read the words 'SUBMIT', 'ACCEPT' and 'TURING' along three edges of the big cube.

<image>

You are given a list of valid words. Each word from the wordlist may appear on arbitrarily many edges of a valid cubeword. Find and report the number of different cubewords that can be constructed, modulo 998,244,353.

If one cubeword can be obtained from another by rotation or mirroring, they are considered distinct.

Input

The first line contains a single integer n (1 ≤ n ≤ 100,000) – the number of words.

Then, n lines follow. Each of these lines contains one word that can appear on the edges of the big cube. The length of each word is between 3 and 10, inclusive.

It is guaranteed that all words are different.

Output

Output a single integer, the number of distinct cubewords for the given list of valid words modulo 998,244,353.

Scoring

Subtask 1 (21 points): the words consist only of letters 'a' - 'f' (lowercase)

Subtask 2 (29 points): the words consist only of letters 'a' - 'p' (lowercase)

Subtask 3 (34 points): the words consist of letters 'a' - 'p' (lowercase) and 'A' - 'P' (uppercase)

Subtask 4 (16 points): the words consist of letters 'a' - 'z' (lowercase), 'A' - 'Z' (uppercase) and digits '0' - '9'

Examples

Input


1
radar


Output


1


Input


1
robot


Output


2


Input


2
FLOW
WOLF


Output


2


Input


2
baobab
bob


Output


4097


Input


3
TURING
SUBMIT
ACCEPT


Output


162


Input


3
MAN1LA
MAN6OS
AN4NAS


Output


114

Note

In the first sample, the only possibility is for the word "radar" to be on each edge of the cube.

In the second sample, there are two cubes, which are just rotations of each other – the word "robot" is on every edge, and the difference between the two cubes is whether the lower left front corner contains 'r' or 't'.

The third sample is similar to the second one. The fact that we can read the word on each edge in both directions does not affect the answer.

In the fourth sample, there is one cube with the word "bob" on each edge. There are also 2^{12} = 4096 cubes with the word "baobab" on each edge. (For each of the 12 edges, we have two possible directions in which the word "baobab" can appear.)

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
const int kMaxId = 26 * 2 + 10;
int Idx(const char c) {
  if ('a' <= c && c <= 'z') {
    return c - 'a';
  }
  if ('A' <= c && c <= 'Z') {
    return int(c - 'A') + 26;
  }
  return int(c - '0') + 26 * 2;
}
long long counts[kMaxId][kMaxId];
long long dp[kMaxId][kMaxId][kMaxId];
long long Solve(string *a, const int n) {
  const int l = a[0].size();
  if (l == 1) {
    return n;
  }
  for (int a = 0; a < kMaxId; ++a) {
    for (int b = 0; b < kMaxId; ++b) {
      counts[a][b] = 0;
    }
  }
  for (int i = 0; i < n; ++i) {
    ++counts[Idx(a[i][0])][Idx(a[i][a[i].size() - 1])];
  }
  for (int a = 0; a < kMaxId; ++a) {
    for (int b = 0; b < kMaxId; ++b) {
      for (int c = 0; c < kMaxId; ++c) {
        if (a > b) {
          dp[a][b][c] = dp[b][a][c];
          continue;
        }
        if (b > c) {
          dp[a][b][c] = dp[a][c][b];
          continue;
        }
        dp[a][b][c] = 0;
        for (int d = 0; d < kMaxId; ++d) {
          dp[a][b][c] += (counts[d][a] * counts[d][b] * counts[d][c]) % MOD;
        }
        dp[a][b][c] %= MOD;
      }
    }
  }
  long long answer = 0;
  for (int a = 0; a < kMaxId; ++a) {
    for (int b = a + 1; b < kMaxId; ++b) {
      for (int c = b + 1; c < kMaxId; ++c) {
        long long sum = 0;
        for (int d = 0; d < kMaxId; ++d) {
          const long long m1 = (dp[d][a][c] * dp[d][a][b]) % MOD;
          const long long m2 = (m1 * dp[d][b][c]) % MOD;
          sum = sum + m2;
        }
        answer = (answer + (sum % MOD) * 6 * dp[a][b][c]) % MOD;
      }
    }
  }
  for (int a = 0; a < kMaxId; ++a) {
    for (int b = 0; b < kMaxId; ++b) {
      if (a == b) {
        continue;
      }
      long long sum = 0;
      for (int d = 0; d < kMaxId; ++d) {
        const long long m1 = (dp[d][a][b] * dp[d][a][b]) % MOD;
        const long long m2 = (m1 * dp[d][b][b]) % MOD;
        sum = sum + m2;
      }
      answer = (answer + (sum % MOD) * 3 * dp[a][b][b]) % MOD;
    }
  }
  for (int a = 0; a < kMaxId; ++a) {
    long long sum = 0;
    for (int d = 0; d < kMaxId; ++d) {
      const long long m1 = (dp[d][a][a] * dp[d][a][a]) % MOD;
      const long long m2 = (m1 * dp[d][a][a]) % MOD;
      sum = sum + m2;
    }
    answer = (answer + (sum % MOD) * dp[a][a][a]) % MOD;
  }
  return answer % MOD;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  long long totalCount = 0;
  int m;
  cin >> m;
  vector<string> dict(m * 2);
  for (int i = 0; i < m; ++i) {
    cin >> dict[i];
    dict[m + i] = dict[i];
    reverse(dict[m + i].begin(), dict[m + i].end());
  }
  sort(dict.begin(), dict.end());
  dict.resize(unique(dict.begin(), dict.end()) - dict.begin());
  sort(dict.begin(), dict.end(),
       [&](const string &s, const string &t) { return s.size() < t.size(); });
  for (size_t i = 0, j = 0; i < dict.size(); i = j) {
    for (j = i + 1; j < dict.size() && dict[j].size() == dict[i].size(); ++j)
      ;
    totalCount = (totalCount + Solve(&dict[i], j - i)) % MOD;
  }
  totalCount = (totalCount % MOD + MOD) % MOD;
  cout << totalCount << endl;
  return 0;
}