stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



int main(){

int n;

cin>>n;

    string s,s2;

    cin>>s;

    int k=s.size();

    if(n%2!=0)cout<<"No\n";

    else

    {

        int t=k/2;

        string m="";

        string w="";

int i,j,k;        for(i=0;i<t;i++)

            m=m+s[i];

        for(i=t;i<s.size();i++)

            w=w+s[i];

            ///cout<<m<<"  "<<w<<endl;

            if(m.compare(w)==0)

                cout<<"Yes\n";

            else cout<<"No\n";



    }



    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.336612980639247x):
#include <stdio.h>

int main(){

    int num;

    scanf("%d", &num);

    int count = 0;

    if(num % 2 == 1){//jika panjang str tdk bisa dibagi 2, maka langsung return 0

        printf("No\n");

        return 0;

    }

    char str[num];

    scanf("%s", str);

    for(int i = 0; str[i] != '\0'; i++){

        if(str[i] == str[(num / 2) + i]){//kasus jika ada 6 huruf

            count++;//untuk mengecek huruf pertama dan ke empat sama gak

        }

    }

    if(count == num / 2){//jika counter == panjang str / 2

        printf("Yes\n");

    }else{

        printf("No\n");

    }

    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

#define ll long long

#define pb push_back

using namespace std;



int main()

{

	ios_base::sync_with_stdio(false);

	cin.tie(NULL);

	int n;

	cin >> n;

	string str;

	cin >> str;

	if(n%2 != 0)

	  cout << "No";

	else

	{

		string str1 = str.substr(0,n/2);

		string str2 = str.substr(n/2,n/2);

		if(str1 == str2)

		   cout << "Yes";

		else

		   cout << "No";

	}

	return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.36681065230638x):
#include <stdio.h>

int main() {

	int n, equal = 0;

	scanf("%d",&n);

	char str[n+1];

	scanf("%s",&str);



	for (int i = 0, j = n/2; i < n/2; i++,j++)

	{

		if (str[i] == str[j])

		{

			equal++;

		}

	}

	if (n % 2 == 1)

	{

		puts("No\n");

		return 0;

	}

	equal == n/2 ? puts("Yes\n") : puts("No\n");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



int main(){

int n;

cin>>n;

    string s,s2;

    cin>>s;

    int k=s.size();

    if(n%2!=0)cout<<"No\n";

    else

    {

        int t=k/2;

        string m="";

        string w="";

int i,j,k;        for(i=0;i<t;i++)

            m=m+s[i];

        for(i=t;i<s.size();i++)

            w=w+s[i];

            ///cout<<m<<"  "<<w<<endl;

            if(m.compare(w)==0)

                cout<<"Yes\n";

            else cout<<"No\n";



    }



    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.336048449726435x):
#include <stdio.h>

int main() {

	int n, equal = 0;

	scanf("%d",&n);

	char str[n+1];

	scanf("%s",&str);



	for (int i = 0, j = n/2; i < n/2; i++,j++)

	{

		if (str[i] == str[j])

		{

			equal++;

		}

	}

	if (n % 2 == 1)

	{

		puts("No\n");

		return 0;

	}

	equal == n/2 ? puts("Yes\n") : puts("No\n");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

#define ll long long

#define pb push_back

using namespace std;



int main()

{

	ios_base::sync_with_stdio(false);

	cin.tie(NULL);

	int n;

	cin >> n;

	string str;

	cin >> str;

	if(n%2 != 0)

	  cout << "No";

	else

	{

		string str1 = str.substr(0,n/2);

		string str2 = str.substr(n/2,n/2);

		if(str1 == str2)

		   cout << "Yes";

		else

		   cout << "No";

	}

	return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.364497700395982x):
#include <stdio.h>



int main(){

	

	int N, total = 0;

	char str[110];

	

	scanf("%d", &N);

	scanf("%s", &str);

	

	for (int i = 0; i<N/2; i++){

		if(str[i] == str[i + N/2]){

			total++;

		}

	}if (N%2 != 0){

		printf("No\n");

		return 0;

	}

	

	total == N/2 ? printf("Yes\n") : printf("No\n");

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



int main(){

int n;

cin>>n;

    string s,s2;

    cin>>s;

    int k=s.size();

    if(n%2!=0)cout<<"No\n";

    else

    {

        int t=k/2;

        string m="";

        string w="";

int i,j,k;        for(i=0;i<t;i++)

            m=m+s[i];

        for(i=t;i<s.size();i++)

            w=w+s[i];

            ///cout<<m<<"  "<<w<<endl;

            if(m.compare(w)==0)

                cout<<"Yes\n";

            else cout<<"No\n";



    }



    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.333748755502927x):
#include <stdio.h>



int main(){

	

	int N, total = 0;

	char str[110];

	

	scanf("%d", &N);

	scanf("%s", &str);

	

	for (int i = 0; i<N/2; i++){

		if(str[i] == str[i + N/2]){

			total++;

		}

	}if (N%2 != 0){

		printf("No\n");

		return 0;

	}

	

	total == N/2 ? printf("Yes\n") : printf("No\n");

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

#define ll long long

#define pb push_back

using namespace std;



int main()

{

	ios_base::sync_with_stdio(false);

	cin.tie(NULL);

	int n;

	cin >> n;

	string str;

	cin >> str;

	if(n%2 != 0)

	  cout << "No";

	else

	{

		string str1 = str.substr(0,n/2);

		string str2 = str.substr(n/2,n/2);

		if(str1 == str2)

		   cout << "Yes";

		else

		   cout << "No";

	}

	return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.364564929222474x):
#include <stdio.h>



int main() {

	int Zx, count = 0;

	int count1, count2;

	char Yz[104] = {};

	scanf("%d %s", &Zx, &Yz);

	if (Zx % 2 != 0) {

		printf("No");

		return 0;

	}

	int haafu = Zx / 2;

	for (int u = 0; u < haafu; u++) {

		if (Yz[u] == Yz[u + haafu]) {

			count++;

		}

	}

	count == haafu ? printf("Yes") : printf("No");



	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



int main(){

int n;

cin>>n;

    string s,s2;

    cin>>s;

    int k=s.size();

    if(n%2!=0)cout<<"No\n";

    else

    {

        int t=k/2;

        string m="";

        string w="";

int i,j,k;        for(i=0;i<t;i++)

            m=m+s[i];

        for(i=t;i<s.size();i++)

            w=w+s[i];

            ///cout<<m<<"  "<<w<<endl;

            if(m.compare(w)==0)

                cout<<"Yes\n";

            else cout<<"No\n";



    }



    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.333815598978246x):
#include <stdio.h>



int main() {

	int Zx, count = 0;

	int count1, count2;

	char Yz[104] = {};

	scanf("%d %s", &Zx, &Yz);

	if (Zx % 2 != 0) {

		printf("No");

		return 0;

	}

	int haafu = Zx / 2;

	for (int u = 0; u < haafu; u++) {

		if (Yz[u] == Yz[u + haafu]) {

			count++;

		}

	}

	count == haafu ? printf("Yes") : printf("No");



	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

#define ll long long

#define pb push_back

using namespace std;



int main()

{

	ios_base::sync_with_stdio(false);

	cin.tie(NULL);

	int n;

	cin >> n;

	string str;

	cin >> str;

	if(n%2 != 0)

	  cout << "No";

	else

	{

		string str1 = str.substr(0,n/2);

		string str2 = str.substr(n/2,n/2);

		if(str1 == str2)

		   cout << "Yes";

		else

		   cout << "No";

	}

	return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.3780312890744195x):
#include <stdio.h>

int main (){

int N,flag= 0,j=0;

scanf("%d",&N);

char S [N];

scanf("%s",S);

for (int i =N/2;i < N; i++){

	if(N % 2 != 0){

		flag++;

		break;

	}else if (S[j] == S[i]){

		j++;

		

	}else {

		flag++;

		break;

	}

}

	flag != 0 ? puts ("No") : puts ("Yes");

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



int main(){

int n;

cin>>n;

    string s,s2;

    cin>>s;

    int k=s.size();

    if(n%2!=0)cout<<"No\n";

    else

    {

        int t=k/2;

        string m="";

        string w="";

int i,j,k;        for(i=0;i<t;i++)

            m=m+s[i];

        for(i=t;i<s.size();i++)

            w=w+s[i];

            ///cout<<m<<"  "<<w<<endl;

            if(m.compare(w)==0)

                cout<<"Yes\n";

            else cout<<"No\n";



    }



    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.347204770548991x):
#include <stdio.h>

int main (){

int N,flag= 0,j=0;

scanf("%d",&N);

char S [N];

scanf("%s",S);

for (int i =N/2;i < N; i++){

	if(N % 2 != 0){

		flag++;

		break;

	}else if (S[j] == S[i]){

		j++;

		

	}else {

		flag++;

		break;

	}

}

	flag != 0 ? puts ("No") : puts ("Yes");

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

#define ll long long

#define pb push_back

using namespace std;



int main()

{

	ios_base::sync_with_stdio(false);

	cin.tie(NULL);

	int n;

	cin >> n;

	string str;

	cin >> str;

	if(n%2 != 0)

	  cout << "No";

	else

	{

		string str1 = str.substr(0,n/2);

		string str2 = str.substr(n/2,n/2);

		if(str1 == str2)

		   cout << "Yes";

		else

		   cout << "No";

	}

	return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.367223498770832x):
#include <stdio.h>



int main(){

	int n;

	scanf("%d",&n);

	char string[n];

	scanf("%s",string);

	

	int flag = 1;

	

	if (n%2 == 1){

		printf("No");

		return 0;

	} else{

	for (int i=0 ; i < n/2 ; i++){

		if (string[i] == string[i+n/2]){

	

		}

		else {

			flag = 0;

		}

	}

}

	(flag==1)?printf("Yes"):printf("No");	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



int main(){

int n;

cin>>n;

    string s,s2;

    cin>>s;

    int k=s.size();

    if(n%2!=0)cout<<"No\n";

    else

    {

        int t=k/2;

        string m="";

        string w="";

int i,j,k;        for(i=0;i<t;i++)

            m=m+s[i];

        for(i=t;i<s.size();i++)

            w=w+s[i];

            ///cout<<m<<"  "<<w<<endl;

            if(m.compare(w)==0)

                cout<<"Yes\n";

            else cout<<"No\n";



    }



    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.336458929782345x):
#include <stdio.h>



int main(){

	int n;

	scanf("%d",&n);

	char string[n];

	scanf("%s",string);

	

	int flag = 1;

	

	if (n%2 == 1){

		printf("No");

		return 0;

	} else{

	for (int i=0 ; i < n/2 ; i++){

		if (string[i] == string[i+n/2]){

	

		}

		else {

			flag = 0;

		}

	}

}

	(flag==1)?printf("Yes"):printf("No");	

	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <string.h>

using namespace std;



int main() {

    ios::sync_with_stdio(false);

    int n;

    cin >> n;

    string s;

    cin >> s;

    if (n % 2 == 1) {

        cout << "No"<<endl;

    } else {

        string s1 = s.substr(0, n / 2);

        string s2 = s.substr(n / 2, n / 2);

        if (s1 == s2) {

            cout << "Yes"<<endl;

        } else {

            cout << "No"<<endl;

        }

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.417568526153908x):
#include<stdio.h>

#include<string.h>



typedef long long ll;



int main(){

	char x[105];

	int n;

	scanf("%d",&n);

	getchar();

	scanf("%s",x);

	if(n%2==1){

		printf("No");

		return 0;

	}

	n/=2;

	for(int i=0;i<n;i++){

		if(x[i]!=x[i+n]){

			printf("No");

			return 0;

		}

	}

	printf("Yes");

}
// Slower C++ solution:
/*

*----------------------------------------------

*   Saurabh Srivastava - SAURASS - andha_koder

*----------------------------------------------

*/

#include<bits/stdc++.h>

using namespace std;



typedef long long int ll;



int main() {

    ll n;

    cin >> n;

    string s;

    cin >> s;

    

    ll mid = 0;

    bool flag = false;

	if(n % 2 == 0) {

		mid = n/2;

	

		for(int i = 0; i < mid; i++) {

			if(s[i] == s[mid + i])

				flag = true;

			else {

				flag = false;

				break;

			}

		}

	}



    if(flag)

		cout << "Yes";

	else

		cout << "No";

    

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.280090246892718x):
#include<stdio.h>

#include<string.h>



typedef long long ll;



int main(){

	char x[105];

	int n;

	scanf("%d",&n);

	getchar();

	scanf("%s",x);

	if(n%2==1){

		printf("No");

		return 0;

	}

	n/=2;

	for(int i=0;i<n;i++){

		if(x[i]!=x[i+n]){

			printf("No");

			return 0;

		}

	}

	printf("Yes");

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main(){

	

	int n,i; cin >> n;

	string s; cin >> s;

	bool b=1;

	

	if (n%2 == 1) b = 0;

	else{

		for (i=0 ; i<n/2 ; i++)

			if (s[i] != s[i+n/2]){

				b = 0; break;

			}

	}

	

	if (b) cout << "Yes\n";

	else cout << "No\n";

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.322377645716307x):
#include<stdio.h>

#include<string.h>



typedef long long ll;



int main(){

	char x[105];

	int n;

	scanf("%d",&n);

	getchar();

	scanf("%s",x);

	if(n%2==1){

		printf("No");

		return 0;

	}

	n/=2;

	for(int i=0;i<n;i++){

		if(x[i]!=x[i+n]){

			printf("No");

			return 0;

		}

	}

	printf("Yes");

}
// Slower C++ solution:
#include <iostream>

#include <string.h>

using namespace std;



int main() {

    ios::sync_with_stdio(false);

    int n;

    cin >> n;

    string s;

    cin >> s;

    if (n % 2 == 1) {

        cout << "No"<<endl;

    } else {

        string s1 = s.substr(0, n / 2);

        string s2 = s.substr(n / 2, n / 2);

        if (s1 == s2) {

            cout << "Yes"<<endl;

        } else {

            cout << "No"<<endl;

        }

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.407900479965824x):
#include<stdio.h>



int main(){

	int n;

	char str[255];

	

	scanf("%d", &n);

	scanf("%s", str);

	

	int flag=1;

	if(n%2!=0){

	    flag=0;    

	} 

	for(int i=0; i<n/2; i++){

     	if(str[i] != (str[(n/2)+i])){

     	    flag=0;

     	    }	

        }

        

        if(flag){

            printf("Yes\n");

        }

        else{

            printf("No\n");

        }

    return 0;

}
// Slower C++ solution:
/*

*----------------------------------------------

*   Saurabh Srivastava - SAURASS - andha_koder

*----------------------------------------------

*/

#include<bits/stdc++.h>

using namespace std;



typedef long long int ll;



int main() {

    ll n;

    cin >> n;

    string s;

    cin >> s;

    

    ll mid = 0;

    bool flag = false;

	if(n % 2 == 0) {

		mid = n/2;

	

		for(int i = 0; i < mid; i++) {

			if(s[i] == s[mid + i])

				flag = true;

			else {

				flag = false;

				break;

			}

		}

	}



    if(flag)

		cout << "Yes";

	else

		cout << "No";

    

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.270667540721532x):
#include<stdio.h>



int main(){

	int n;

	char str[255];

	

	scanf("%d", &n);

	scanf("%s", str);

	

	int flag=1;

	if(n%2!=0){

	    flag=0;    

	} 

	for(int i=0; i<n/2; i++){

     	if(str[i] != (str[(n/2)+i])){

     	    flag=0;

     	    }	

        }

        

        if(flag){

            printf("Yes\n");

        }

        else{

            printf("No\n");

        }

    return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main(){

	

	int n,i; cin >> n;

	string s; cin >> s;

	bool b=1;

	

	if (n%2 == 1) b = 0;

	else{

		for (i=0 ; i<n/2 ; i++)

			if (s[i] != s[i+n/2]){

				b = 0; break;

			}

	}

	

	if (b) cout << "Yes\n";

	else cout << "No\n";

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.31287947459751x):
#include<stdio.h>



int main(){

	int n;

	char str[255];

	

	scanf("%d", &n);

	scanf("%s", str);

	

	int flag=1;

	if(n%2!=0){

	    flag=0;    

	} 

	for(int i=0; i<n/2; i++){

     	if(str[i] != (str[(n/2)+i])){

     	    flag=0;

     	    }	

        }

        

        if(flag){

            printf("Yes\n");

        }

        else{

            printf("No\n");

        }

    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <string.h>

using namespace std;



int main() {

    ios::sync_with_stdio(false);

    int n;

    cin >> n;

    string s;

    cin >> s;

    if (n % 2 == 1) {

        cout << "No"<<endl;

    } else {

        string s1 = s.substr(0, n / 2);

        string s2 = s.substr(n / 2, n / 2);

        if (s1 == s2) {

            cout << "Yes"<<endl;

        } else {

            cout << "No"<<endl;

        }

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.417628049738313x):
#include <stdio.h>



int main() {

	int n;

	scanf("%d", &n);

	char arr[n];

	scanf("%s", arr);

	if(n % 2 != 0) {

		printf("No\n");

	}

	else if (n % 2 == 0){

		int flag = 1;

		for(int i = 0; i < n / 2; i++) {

			if(arr[i] != arr[(n / 2) + i]) {

				flag = 0;

				break;

			}

		}

		if(flag == 0) {

			printf("No\n");

		}

		else {

			printf("Yes\n");

		}

	}

	

	return 0;

}
// Slower C++ solution:
/*

*----------------------------------------------

*   Saurabh Srivastava - SAURASS - andha_koder

*----------------------------------------------

*/

#include<bits/stdc++.h>

using namespace std;



typedef long long int ll;



int main() {

    ll n;

    cin >> n;

    string s;

    cin >> s;

    

    ll mid = 0;

    bool flag = false;

	if(n % 2 == 0) {

		mid = n/2;

	

		for(int i = 0; i < mid; i++) {

			if(s[i] == s[mid + i])

				flag = true;

			else {

				flag = false;

				break;

			}

		}

	}



    if(flag)

		cout << "Yes";

	else

		cout << "No";

    

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.280148259984008x):
#include <stdio.h>



int main() {

	int n;

	scanf("%d", &n);

	char arr[n];

	scanf("%s", arr);

	if(n % 2 != 0) {

		printf("No\n");

	}

	else if (n % 2 == 0){

		int flag = 1;

		for(int i = 0; i < n / 2; i++) {

			if(arr[i] != arr[(n / 2) + i]) {

				flag = 0;

				break;

			}

		}

		if(flag == 0) {

			printf("No\n");

		}

		else {

			printf("Yes\n");

		}

	}

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main(){

	

	int n,i; cin >> n;

	string s; cin >> s;

	bool b=1;

	

	if (n%2 == 1) b = 0;

	else{

		for (i=0 ; i<n/2 ; i++)

			if (s[i] != s[i+n/2]){

				b = 0; break;

			}

	}

	

	if (b) cout << "Yes\n";

	else cout << "No\n";

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.322436123425171x):
#include <stdio.h>



int main() {

	int n;

	scanf("%d", &n);

	char arr[n];

	scanf("%s", arr);

	if(n % 2 != 0) {

		printf("No\n");

	}

	else if (n % 2 == 0){

		int flag = 1;

		for(int i = 0; i < n / 2; i++) {

			if(arr[i] != arr[(n / 2) + i]) {

				flag = 0;

				break;

			}

		}

		if(flag == 0) {

			printf("No\n");

		}

		else {

			printf("Yes\n");

		}

	}

	

	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <string.h>

using namespace std;



int main() {

    ios::sync_with_stdio(false);

    int n;

    cin >> n;

    string s;

    cin >> s;

    if (n % 2 == 1) {

        cout << "No"<<endl;

    } else {

        string s1 = s.substr(0, n / 2);

        string s2 = s.substr(n / 2, n / 2);

        if (s1 == s2) {

            cout << "Yes"<<endl;

        } else {

            cout << "No"<<endl;

        }

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.405363927321955x):
#include <stdio.h>



int main(){

	int n;

	scanf("%d", &n);

	getchar();

	

	char letter[n+1];

	scanf("%[^\n]", letter);

	

	if(n % 2 == 0){

		int mid = n / 2;

		

		int flag = 0;

		for(int i = 0; i < mid; i++){

			if(letter[i] != letter[i + mid]){

				flag = 1;

				break;

			}

		}

		

		if(flag == 0){

			printf("Yes");

		}

		else{

			printf("No");

		}

	}

	else{

		printf("No");

	}

	

	return 0;

}
// Slower C++ solution:
/*

*----------------------------------------------

*   Saurabh Srivastava - SAURASS - andha_koder

*----------------------------------------------

*/

#include<bits/stdc++.h>

using namespace std;



typedef long long int ll;



int main() {

    ll n;

    cin >> n;

    string s;

    cin >> s;

    

    ll mid = 0;

    bool flag = false;

	if(n % 2 == 0) {

		mid = n/2;

	

		for(int i = 0; i < mid; i++) {

			if(s[i] == s[mid + i])

				flag = true;

			else {

				flag = false;

				break;

			}

		}

	}



    if(flag)

		cout << "Yes";

	else

		cout << "No";

    

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.268195356602224x):
#include <stdio.h>



int main(){

	int n;

	scanf("%d", &n);

	getchar();

	

	char letter[n+1];

	scanf("%[^\n]", letter);

	

	if(n % 2 == 0){

		int mid = n / 2;

		

		int flag = 0;

		for(int i = 0; i < mid; i++){

			if(letter[i] != letter[i + mid]){

				flag = 1;

				break;

			}

		}

		

		if(flag == 0){

			printf("Yes");

		}

		else{

			printf("No");

		}

	}

	else{

		printf("No");

	}

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main(){

	

	int n,i; cin >> n;

	string s; cin >> s;

	bool b=1;

	

	if (n%2 == 1) b = 0;

	else{

		for (i=0 ; i<n/2 ; i++)

			if (s[i] != s[i+n/2]){

				b = 0; break;

			}

	}

	

	if (b) cout << "Yes\n";

	else cout << "No\n";

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.310387491150741x):
#include <stdio.h>



int main(){

	int n;

	scanf("%d", &n);

	getchar();

	

	char letter[n+1];

	scanf("%[^\n]", letter);

	

	if(n % 2 == 0){

		int mid = n / 2;

		

		int flag = 0;

		for(int i = 0; i < mid; i++){

			if(letter[i] != letter[i + mid]){

				flag = 1;

				break;

			}

		}

		

		if(flag == 0){

			printf("Yes");

		}

		else{

			printf("No");

		}

	}

	else{

		printf("No");

	}

	

	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <string.h>

using namespace std;



int main() {

    ios::sync_with_stdio(false);

    int n;

    cin >> n;

    string s;

    cin >> s;

    if (n % 2 == 1) {

        cout << "No"<<endl;

    } else {

        string s1 = s.substr(0, n / 2);

        string s2 = s.substr(n / 2, n / 2);

        if (s1 == s2) {

            cout << "Yes"<<endl;

        } else {

            cout << "No"<<endl;

        }

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.4256504381690505x):
#include <stdio.h>



int main(){

	int idx=0;

	scanf("%d", &idx);

	char str[idx+1];

	scanf("%s", &str);

	if(idx%2==1){

		puts("No");

	}

	else{

		int tanda = 1;

		

		for(int i=0; i < idx/2; i++){

			if(str[i] != str[i + idx/2]){

				tanda = 0;

			}

		}

		if(tanda==1){

			puts("Yes");

		}

		else{

			puts("No");

		}

	}

	

	return 0;

}
// Slower C++ solution:
/*

*----------------------------------------------

*   Saurabh Srivastava - SAURASS - andha_koder

*----------------------------------------------

*/

#include<bits/stdc++.h>

using namespace std;



typedef long long int ll;



int main() {

    ll n;

    cin >> n;

    string s;

    cin >> s;

    

    ll mid = 0;

    bool flag = false;

	if(n % 2 == 0) {

		mid = n/2;

	

		for(int i = 0; i < mid; i++) {

			if(s[i] == s[mid + i])

				flag = true;

			else {

				flag = false;

				break;

			}

		}

	}



    if(flag)

		cout << "Yes";

	else

		cout << "No";

    

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.287967069234953x):
#include <stdio.h>



int main(){

	int idx=0;

	scanf("%d", &idx);

	char str[idx+1];

	scanf("%s", &str);

	if(idx%2==1){

		puts("No");

	}

	else{

		int tanda = 1;

		

		for(int i=0; i < idx/2; i++){

			if(str[i] != str[i + idx/2]){

				tanda = 0;

			}

		}

		if(tanda==1){

			puts("Yes");

		}

		else{

			puts("No");

		}

	}

	

	return 0;

}