Description

Original Source: BalticOI 2009

You are given a string that is formed by repeated concatenation of some other string. However, the original string is unknown, and now you only want to determine the minimum possible length of this original string.

Input Format

The first line contains the length of the string, $L$. The second line contains the string itself, consisting entirely of lowercase letters.

Output Format

Output the minimum possible length of the original string.

Sample 1

For the sample input, the string abc can be repeatedly concatenated to form abcabcabc, and the input string cabcabca is a substring of it.

8
cabcabca

3

Data Range and Hints

For all test cases, $1\le L\le 10^6$.