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
import java.util.Scanner;
 
public class Main {
 
	public static void main(String[] args) {
		Scanner scan =new java.util.Scanner(System.in);
		int n = scan.nextInt();
		String str = scan.next();
		if(n%2==0) {
			for(int i=0;i < n/2; i++) {
				if(str.charAt(i)!=str.charAt((n/2)+i)) {
					System.out.println("No");
					System.exit(0);
				}
			}
			System.out.println("Yes");
		}
		else {
			System.out.println("No");
		}
	}
}