import java.util.Scanner;

public class Main{
	public static void main(String[] args){
		Scanner s=new Scanner(System.in);
		int n=s.nextInt();
		int n_middle = n/2;
		boolean flag = true;
		String[] a = new String[n];
		String str;
		str = s.next();
		// 変数strの長さ分回す
		for (int i = 0; i < str.length(); i++) {
		    // 配列に順番に格納する
		    a[i] = String.valueOf(str.charAt(i));
		}

		if(n_middle == 0 || str.length() % 2 != 0) {
			flag = false;
		}else
		{
		for(int i=0; i<n_middle; i++) {
			if(!a[i].equals(a[n_middle+i])) {
				flag = false;
			}
		}
		}


		if(flag == true) {
			System.out.print("Yes");
		}else {
			System.out.print("No");
		}

	}
}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz