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 sc = new Scanner(System.in);
		int n = sc.nextInt();
		if(n % 2 ==1) {
			System.out.println("No");
		}else {
			char[] s = sc.next().toCharArray();
			boolean flag = true;
			for (int i = 0; i < n/2; i++) {
				if(s[i] != s[i+n/2]) {
					flag = false;
					break;
				}
			}
			System.out.println(flag ? "Yes":"No");
		}
		sc.close();
	}
}