#include<bits/stdc++.h>

using namespace std;
#define ll long long 
int main() {
int x;
cin>>x;
string h;
cin>>h;
for(int i=1;i<x;i++)
if(h.substr(0,i)==h.substr(i,x))
return cout<<"Yes",0;
cout<<"No"<<endl;
   
    return 0;
}
### Prompt

Develop a solution in CPP to the problem described below:

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;
#define ll long long 
int main() {
int x;
cin>>x;
string h;
cin>>h;
for(int i=1;i<x;i++)
if(h.substr(0,i)==h.substr(i,x))
return cout<<"Yes",0;
cout<<"No"<<endl;
   
    return 0;
}
```