10792: ABC145 - B - Echo
[Creator : ]
Description
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$.
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$.
Input
Input is given from Standard Input in the following format:
```
$N$
$S$
```
```
$N$
$S$
```
Output
If $S$ is a concatenation of two copies of some string, print `Yes`; otherwise, print `No`.
Constraints
- $1 \leq N \leq 100$
- $S$ consists of lowercase English letters.
- $|S| = N$
- $S$ consists of lowercase English letters.
- $|S| = N$
Sample 1 Input
6
abcabc
Sample 1 Output
Yes
Let $T = $ abc, and $S = T + T$.
Sample 2 Input
6
abcadc
Sample 2 Output
No
Sample 3 Input
1
z
Sample 3 Output
No