Codeforces #410(div2) B. Mike and strings （暴力枚举

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 s₁, s₂, …, s_n each consisting of lowercase English letters. In one move he can choose a string s_i, 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 s_i. 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“.

暴力枚举所有情况QAQ

#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
const int mod = 1e9+7;
const int N = 1010;
char q[100], a[100],w[100];
char str[N][N];
int n, len;
void f(char aa[],char b[], int x)
{
    for(int i = 0;i < len; i++) {
        aa[i] = b[(i+x)%len];
    }
//  aa[len] = '\0';
}
int main()
{
    scanf("%d",&n);
    getchar();
    scanf("%s",a);
    for(int i = 1;i < n; i++) scanf("%s",str[i]);
    len = strlen(a);
    int ans = inf;
    for(int i = 0;i <= len-1; i++) {
        int tmp = i;
        f(q,a,i);
        int go = 0;
        for(int j = 1; j < n; j++) {
            int low = inf;
            for(int k = 0;k <= len-1; k++) {
                f(w,str[j],k);
                if(strcmp(q,w)==0) {
                    tmp += k;
                    go++;
                    break;
                }
            }
        }
        if(go == n-1) ans = min(ans,tmp);
    }
    if(ans == inf) puts("-1");
    else    printf("%d\n",ans);
return 0;
}