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 Scanner(System.in);
		int strLength = scan.nextInt();
		if(strLength % 2 == 0) {
			String strInput  = scan.next(); 				
			String result = strInput.subSequence(0, (strLength/2)).equals(strInput.substring((strLength/2), strLength)) ? "Yes" : "No";
			System.out.println(result);
		}
		else {
			System.out.println("No");
		}
			
	}
}
