Periodic String

Time limit2sMemory limit2048 MB

Summary

Given a string S of length N, the task is to check whether S is some string T repeated at least twice, printing Yes or No.

Level: Easy2 of 10
Topics: String, Brute force
Solved: No attempts yet

Problem

A string $S$ of length $N$ is given. Each character of $S$ is a lowercase English letter.

If there exist a string $T$ and an integer $m$ ( $2 \le m$ ) such that concatenating $T$ $m$ times in order gives $S$ , then $S$ is called periodic.

Print Yes if $S$ is periodic, and No otherwise.

Input

The input is given in the following format.

N
S

Output

Print Yes if $S$ is periodic, and No otherwise. Print nothing other than the answer, including no prompts for input.

Constraints

$2 \le N \le 1000$ .
$S$ is a string of length $N$ .
Each character of $S$ is a lowercase English letter.
$N$ is an integer.

Examples4

Example 1
Input
```
6
ababab
```
Expected output
```
Yes
```
Example 2
Input
```
7
abcabca
```
Expected output
```
No
```
Example 3
Input
```
2
aa
```
Expected output
```
Yes
```
Example 4
Input
```
8
ababcdcd
```
Expected output
```
No
```