There are eight planets and one planetoid in the Solar system. It is not a well known fact that there is a secret planet S4 inhabited by small creatures similar to bears, their codename being Lodas. Although this fact is well hidden from the public, the association Savez sent a team lead by general Henrik to study the Lodas. It has been discovered that Lodas have the ability of teleportation and he wants to hire them in his army.

One Lod consists of $N$ strings where the $i$-th string is denoted by $x_ i$. Research has shown that the number of teleportations a Loda can make depends on one special subsequence (not necessarily consecutive) of these strings. Strings $x_ i$ and $x_ j$ ($i < j$) can both be in that sequence if and only if string $x_ j$ both starts with and ends with string $x_ i$. The number of teleportations a Loda can make is the length of the longest described subsequence.

Determine the number of teleportations.

-----Input-----
The first line of input contains of the integer $N$, the number of strings. Each of the following $N$ lines contains one string consisting of uppercase letters of the English alphabet. The input data will be such that there will be less than two million characters in total.

-----Output-----
The first and only line of output must contain the number of teleportations a Loda can make.

-----Examples-----
Sample Input 1:
5
A
B
AA
BBB
AAA
Sample Output 1:
3

Sample Input 2:
5
A
ABA
BBB
ABABA
AAAAAB
Sample Output 2:
3

Difficulty: competition

Starter code:

Solutions: