#include "bits/stdc++.h"
using namespace std;
int n;
string a;
int main()
{
	cin>>n>>a;

	string s1=a.substr(0,a.size()/2),s2=a.substr(a.size()/2);
	//cout<<s1<<" "<<s2<<endl;
	if(s1==s2) cout<<"Yes";
	else cout<<"No";
}
### Prompt

Please formulate a cpp solution to the following problem:

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

### Response

```cpp
#include "bits/stdc++.h"
using namespace std;
int n;
string a;
int main()
{
	cin>>n>>a;

	string s1=a.substr(0,a.size()/2),s2=a.substr(a.size()/2);
	//cout<<s1<<" "<<s2<<endl;
	if(s1==s2) cout<<"Yes";
	else cout<<"No";
}
```