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);
		
		// N, Sの入力
		int N = sc.nextInt();
		String S = sc.next();
		
		String result = "No";
		
		// Nが偶数の時だけ考える
		if (N % 2 == 0) {
			String front = S.substring(0, N / 2);
			String rear = S.substring(N / 2, N);
			if (front.equals(rear)) {
				result = "Yes";
			}
		}
		// 結果の出力
		System.out.println(result);
		
		sc.close();
	}
}
