Given are a positive integer N and a string S of length N consisting of lowercase English letters.

Determine whether the string is a concatenation of two copies of some string. That is, determine whether there is a string T such that S = T + T.

Constraints

* 1 \leq N \leq 100
* S consists of lowercase English letters.
* |S| = N

Input

Input is given from Standard Input in the following format:


N
S


Output

If S is a concatenation of two copies of some string, print `Yes`; otherwise, print `No`.

Examples

Input

6
abcabc


Output

Yes


Input

6
abcadc


Output

No


Input

1
z


Output

No
#include<cstdio>
const int N=100+10;
char s[N];
int n;
int main()
{
	scanf("%d%s",&n,s+1);
	if(n%2)
	{
		puts("No");
		return 0;
	}
	for(int i=1;i<=n/2;i++)
		if(s[i]!=s[i+n/2])
		{
			puts("No");
			return 0;
		}
	puts("Yes");
	return 0;
}