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 obj=new Scanner(System.in);
int n=obj.nextInt();
String g=obj.next();
if(n%2!=0){
System.out.println("No");
}else{
int p=n/2;
int q=p;
int h=0;
boolean flag=true;

for(;h<p;h++,q++){

if(g.charAt(h)!=g.charAt(q)){
flag=false;
}

}

if(flag){

System.out.println("Yes");
}else{
System.out.println("No");
}
}

}

}