Problem:
Score : 700 points

Problem Statement

Limak can repeatedly remove one of the first two characters of a string,
for example abcxyx \rightarrow acxyx \rightarrow cxyx \rightarrow cyx.

You are given N different strings S_1, S_2, \ldots, S_N.
Among N \cdot (N-1) / 2 pairs (S_i, S_j),
in how many pairs could Limak obtain one string from the other?

Constraints

2 \leq N \leq 200\,000

S_i consists of lowercase English letters a-z.

S_i \neq S_j

1 \leq |S_i|

|S_1| + |S_2| + \ldots + |S_N| \leq 10^6

Input

Input is given from Standard Input in the following format.

N
S_1
S_2
\vdots
S_N

Output

Print the number of unordered pairs (S_i, S_j)
where i \neq j and Limak can obtain one string from the other.

Sample Input 1

3
abcxyx
cyx
abc

Sample Output 1

1

The only good pair is (abcxyx, cyx).

Sample Input 2

6
b
a
abc
c
d
ab

Sample Output 2

5

There are five good pairs: (b, abc), (a, abc), (abc, c), (b, ab), (a, ab).

Solution in Rust (1.42.0) (judge verdict: Runtime Error)

use proconio::*;
use proconio::marker::*;

// A からBが得られるには
// Aの末尾|B| - 1 文字がB[1..] と等しい
// かつAの末尾|B| - 1 文字以外の文字の中に B[0] がある
// O(N^2)
// 文字が長いやつからTrieに挿入、戻る時に存在する文字をbitで覚えてカウンタ更新
//

type Link = Option<Box<Node>>;

const F: usize = 26;

#[derive(Default)]
struct Node {
    cnt: [u32; F],
    next: [Link; F],
}

fn insert(node: &mut Link, s: &[u8], ans: &mut usize) -> usize {
    if node.is_none() {
        *node = Some(Box::new(Node::default()));
    }
    let node = node.as_mut().unwrap();
    if s.len() == 0 {
        0
    } else {
        let k = (s[0] - b'a') as usize;
        let mut mask = insert(&mut node.next[k], &s[1..], ans);
        if s.len() == 1 {
            *ans += node.cnt[k] as usize;
        }
        mask |= 1 << k;
        for (i, c) in node.cnt.iter_mut().enumerate() {
            *c += ((mask >> i) & 1) as u32;
        }
        mask
    }
}

fn run() {
    input! {
        n: usize,
        mut s: [Bytes; n],
    }
    s.sort_by_key(|s| s.len());
    let mut root = None;
    let mut ans = 0;
    for s in s.iter_mut().rev() {
        s.reverse();
        insert(&mut root, s, &mut ans);
    }
    println!("{}", ans);
}

fn main() {
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| run()).unwrap().join().unwrap();
}