B. String Typing(思维)

You are given a string s consisting of n lowercase Latin letters. You have to type this string using your keyboard.

Initially, you have an empty string. Until you type the whole string, you may perform the following operation:

• add a character to the end of the string.

Besides, at most once you may perform one additional operation: copy the string and append it to itself.

For example, if you have to type string abcabca, you can type it in 7 operations if you type all the characters one by one. However, you can type it in 5 operations if you type the string abc first and then copy it and type the last character.

If you have to type string aaaaaaaaa, the best option is to type 4 characters one by one, then copy the string, and then type the remaining character.

Print the minimum number of operations you need to type the given string.

Input

The first line of the input containing only one integer number n (1 ≤ n ≤ 100) — the length of the string you have to type. The second line containing the string s consisting of n lowercase Latin letters.

Output

Print one integer number — the minimum number of operations you need to type the given string.

Examples

Input

Copy

7
abcabca

Output

5

Input

Copy

8
abcdefgh

Output

8

Note

The first test described in the problem statement.

In the second test you can only type all the characters one by one.

题意：

给一个长度为n的字符串，有两种操作

1.在原字符串的基础上一次写一个字符

2.可以将已有字符串复制一份加在原字符串的后边（但只能用一次）

求写出此字符串最少需要几步

思路：由于复制操作只能使用一次，因此要尽可能的使得复制的字符串大

#include<bits/stdc++.h>
using namespace std;
int main(){
	int n;
	string str;
    cin>>n>>str;
    int maxt=1;
    for(int i=0;i<n;i++){
    	string sub1=str.substr(0,i+1);//从0开始长度为i+1 
    	string sub2=str.substr(i+1,i+1);//从i+1开始长度为i+1 
    	if(sub1==sub2) maxt=max(maxt,i+1);
	}
	cout<<n-maxt+1<<endl;
	return 0;
}