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 p=sc.nextInt();
		String c=sc.next();
		char a[]=c.toCharArray();
		int b=0;
		for(int i=0;i<p/2;i++) {
				if(a[i]!=a[i+p/2])
					b++;
		}
		if(p%2==0){
			if(b==0) {
			System.out.print("Yes");	
			}else {
			System.out.print("No");
			}
		}else
			System.out.print("No");
			
	}
}