CodeForces 191A Dynasty Puzzles（DP）

The ancient Berlanders believed that the longer the name, the more important its bearer is. Thus, Berland kings were famous for their long names. But long names are somewhat inconvenient, so the Berlanders started to abbreviate the names of their kings. They called every king by the first letters of its name. Thus, the king, whose name was Victorious Vasily Pupkin, was always called by the berlanders VVP.

In Berland over its long history many dynasties of kings replaced each other, but they were all united by common traditions. Thus, according to one Berland traditions, to maintain stability in the country, the first name of the heir should be the same as the last name his predecessor (hence, the first letter of the abbreviated name of the heir coincides with the last letter of the abbreviated name of the predecessor). Berlanders appreciate stability, so this tradition has never been broken. Also Berlanders like perfection, so another tradition requires that the first name of the first king in the dynasty coincides with the last name of the last king in this dynasty (hence, the first letter of the abbreviated name of the first king coincides with the last letter of the abbreviated name of the last king). This tradition, of course, has also been always observed.

The name of a dynasty is formed by very simple rules: we take all the short names of the kings in the order in which they ruled, and write them in one line. Thus, a dynasty of kings "ab" and "ba" is called "abba", and the dynasty, which had only the king "abca", is called "abca".

Vasya, a historian, has recently found a list of abbreviated names of all Berland kings and their relatives. Help Vasya to find the maximally long name of the dynasty that could have existed in Berland.

Note that in his list all the names are ordered by the time, that is, if name A is earlier in the list than B, then if A and B were kings, then king A ruled before king B.

Input

The first line contains integer n (1 ≤ n ≤ 5·10⁵) — the number of names in Vasya's list. Next n lines contain n abbreviated names, one per line. An abbreviated name is a non-empty sequence of lowercase Latin letters. Its length does not exceed 10characters.

Output

Print a single number — length of the sought dynasty's name in letters.

If Vasya's list is wrong and no dynasty can be found there, print a single number 0.

Example

Input

3
abc
ca
cba

Output

6

Input

4
vvp
vvp
dam
vvp

Output

0

Input

3
ab
c
def

Output

1

Note

In the first sample two dynasties can exist: the one called "abcca" (with the first and second kings) and the one called "abccba" (with the first and third kings).

In the second sample there aren't acceptable dynasties.

The only dynasty in the third sample consists of one king, his name is "c".

题解：

这题一看是dp就差点放弃了，然后随便搜了看到学姐的博客发现这题其实不难：

题意是给你一堆串，只要一个串的尾字符和另一个串的头字符相同就可以合并，问你最终可以得到头尾字符相同的串的最长长度为多少

数组a[i][j]表示字符串编号为i+‘a’，结尾为j+'a'的串的最长长度，就可以开始dp了

对于一个串串长为len,记串开头字符下标为st，结尾字符下标为ed

遍历开头为从a到z的数组a[p][st]，也就是遍历所有p<26,做a[p][ed]=max(a[p][ed],a[p][st]+len)

最后从i=0到25遍历一遍a[i][i]取最大值就是答案

代码：

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<queue>
#include<stack>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<stdlib.h>
#include<cmath>
#include<string>
#include<algorithm>
#include<iostream>
#include<stdio.h>
using namespace std;
#define ll long long
int a[30][30];
char s[15];
int main()
{
    int i,j,n;
    scanf("%d",&n);
    memset(a,0,sizeof(a));
    for(i=0;i<n;i++)
    {
        scanf("%s",s);
        int len=strlen(s);
        int st=s[0]-'a';
        int ed=s[len-1]-'a';
        for(j=0;j<26;j++)
        {
            if(a[j][st])
            {
                a[j][ed]=max(a[j][ed],a[j][st]+len);
            }
        }
        a[st][ed]=max(a[st][ed],len);
    }
    int maxx=0;
    for(i=0;i<26;i++)
    {
        if(a[i][i]>maxx)
        {
            maxx=a[i][i];
        }
    }
    printf("%d\n",maxx);
    return 0;
}