#include <iostream>
#include <string>

using namespace std;

int main () {
   int N;
   cin>>N;
   string S;
   cin>>S;
   if (((N%2==0)) and (S.compare(0,N/2,S,N/2,N/2)==0))
           cout<<"Yes";
   else
       cout<<"No";
   return 0;}

### Prompt

Please provide a cpp coded solution 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 <iostream>
#include <string>

using namespace std;

int main () {
   int N;
   cin>>N;
   string S;
   cin>>S;
   if (((N%2==0)) and (S.compare(0,N/2,S,N/2,N/2)==0))
           cout<<"Yes";
   else
       cout<<"No";
   return 0;}

```