#include"bits/stdc++.h"
using namespace std;
int main(){
	string a;
  int n;
  cin>>n;
	cin>>a;
	if(a.substr ( 0 , a.length()/2 )==a.substr ( a.length()/2 ,a.length()  ))cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
return 0;
} 
### Prompt

Please create a solution in Cpp 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 main(){
	string a;
  int n;
  cin>>n;
	cin>>a;
	if(a.substr ( 0 , a.length()/2 )==a.substr ( a.length()/2 ,a.length()  ))cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
return 0;
} 
```