A-All with Pairs_2020牛客暑期多校训练营（第二场）

时间限制：C/C++/Rust/Pascal 3秒，其他语言6秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld

题目描述

Given ${n}$ strings $s_1, s_2, \cdots, s_n$ . Now define ${f(s, t)}$ as the maximum ${i}$ that satisfy $s_{1\dots i} = t_{|t|-i+1 \dots |t|}$ , and if such ${i}$ doesn't exist, ${f(s, t) = 0}$ .
The Problem is to calculate:
$\sum_{i=1}^{n}\sum_{j=1}^{n}f(s_i, s_j)^2 \pmod{998244353}$

输入描述:

The first line contains one integer , denoting the number of given strings.
The following  lines each contains a string .
It's guaranteed that  and all strings only contain lowercase letters.

输出描述:

Only one line containing one integer, denoting the answer.

示例1

输入

复制

3
ab
ba
aba

输出

复制

说明


So the answer is .