B'Mike has n strings s1, xe2 x80 x89s2, xe2 x80 x89..., xe2 x80 x89sn 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? The first line contains integer n (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x8950) -- 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. Print the minimal number of moves Mike needs in order to make all the strings equal or print xe2 x80 x89- xe2 x80 x891 if there is no solution. In the first sample testcase the optimal scenario is to perform operations in such a way as to transform all strings into "zwoxz". '...