CF-798B

B. Mike and strings

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Mike has n strings s1, s2, ..., sn each consisting of lowercase English letters. In one move he can choose a string si, erase the first character and append it to the end of the string. For example, if he has the string "coolmike", in one move he can transform it into the string "oolmikec".

Now Mike asks himself: what is minimal number of moves that he needs to do in order to make all the strings equal?

Input

The first line contains integer n (1 ≤ n ≤ 50) — the number of strings.

This is followed by n lines which contain a string each. The i-th line corresponding to string si. Lengths of strings are equal. Lengths of each string is positive and don't exceed 50.

Output

Print the minimal number of moves Mike needs in order to make all the strings equal or print  - 1 if there is no solution.

Examples

input

4
xzzwo
zwoxz
zzwox
xzzwo

output

5

input

2
molzv
lzvmo

output

2

input

3
kc
kc
kc

output

0

input

3
aa
aa
ab

output

-1

Note

In the first sample testcase the optimal scenario is to perform operations in such a way as to transform all strings into "zwoxz".

 

 

题意：

将所有字符串变成相等，只允许将最左边的字符移到最右，问最少要移多少步。

若不能使所有相等，则输出-1、

 

分别以每一个字符串为模板，将其他的字符串移成和当前字符串相等的情况，再找出步数最少的方案。

 

附AC代码：

#include<bits/stdc++.h>
using namespace std;

const int inf=1<<30;

string s[60];

int main(){
    int n,i,j,k,m;
    cin>>n;
    for(i=0;i<n;i++){
        cin>>s[i];
    }
    int len=s[0].size();
    int ans=inf;
    for(i=0;i<n;i++){
        int cnt=0;
        for(j=0;j<n;j++){
            for(m=0;m<len;m++){
                for(k=0;k<len;k++){
                    if(s[i][k]!=s[j][(k+m)%len])
                    break;
                }
                if(k==len)//只有len个都相等才表明移动m个字符后两字符串相等 
                break;
            }
            if(m==len){//若m==len则表明不能匹配。 
                cnt=inf;
                break;
            }
            cnt+=m;
        }
        ans=min(ans,cnt);
    }
    if(ans==inf)
    cout<<-1<<endl;
    else
    cout<<ans<<endl;
    return 0;
}