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<bits/stdc++.h>
using namespace std;
int main(){
	int n;
	cin>>n;
	string s,t1,t2;
	cin>>s;
	for(int i=0;i<n/2;i++)
		t1+=s[i];
	for(int i=n/2;i<n;i++)
		t2+=s[i];
	if(t1==t2)cout<<"Yes\n";
	else cout<<"No\n";
	return 0;
}
