codeforces 954B String Typing

B. String Typing

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

刚开始看的时候没看仔细（才不是英语渣呢），以为是用后缀数组写的最长不重叠子串的那个算法，MMP，那只是div2的B题啊，在网上找啊找，直到比赛结束也没搞出来。瞄了某位大神的代码才知道，题意是你输入的字符串是整体复制算一次操作，也就是说，“aabcabc”的最优操作是7而不是5，所以用substr方法一个截前面一个截后面，遍历即可。

总的来说，别总想着套板，要能看懂题目，别想的太复杂，不是所有题目都得用一个所谓的算法才能解开

#include

#include

int main() {

using namespace std;

int n;

int len = s.length(), ans = n;

string s;

while(cin >> n >> s) {

if(s.substr(0, i) == s.substr(i, i)) {//0开始截i个长度，从i开始截i个长度，判断

for(int i = 1; i <= len / 2; i++) {

ans = n - i + 1;

} }

        }

printf("%d\n", ans);

}