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.*;
public class Main {
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int a=sc.nextInt();
		sc.nextLine();
		String b=sc.nextLine();
		String s = "",S="";
		for(int i=0;i<a/2;i++) {
			s+=b.charAt(i);
		}
		for(int i=a/2;i<a;i++) {
			S+=b.charAt(i);
		}
		String can = s.equals(S)?"Yes":"No";
		System.out.println(can);
	}
}
