#include <iostream>
using namespace std;

int main() {
  int n; cin >> n; if (n%2==1) return puts("No") * 0;
  string s; cin >> s;
  for(int i=0; i<n/2; i++) {
    if (s[i] != s[n/2+i]) return puts("No") * 0;
  }
  cout << "Yes" << endl;
}

### 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 <iostream>
using namespace std;

int main() {
  int n; cin >> n; if (n%2==1) return puts("No") * 0;
  string s; cin >> s;
  for(int i=0; i<n/2; i++) {
    if (s[i] != s[n/2+i]) return puts("No") * 0;
  }
  cout << "Yes" << endl;
}

```