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 n = sc.nextInt();
  String str = sc.next();
  if(n%2==1){
    System.out.println("No");
    System.exit(0);
  }else{}
  String str1 = str.substring(0,n/2);
  String str2 = str.substring(n/2);
  if(str1.equals(str2)){
    System.out.println("Yes");
  }else{
    System.out.println("No");
  }


}
}