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.3467101248257185x):
#include <stdio.h>





int main () {

    int n;

    scanf("%d", &n);

    char echo[n + 1];

    scanf("%s", echo);

    if (n % 2 == 1) {

        puts("No");

    }

    else {

        int flag = 1;

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

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

                flag = 0;

            }

        }

        if (flag){

            puts("Yes");

        }

        else {

            puts("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.367615604956353x):
#include <stdio.h>

#include <string.h>

 

int main(){

	int n;

	scanf("%d", &n);

	

	char str[n+1];

	scanf("%s", &str);

	

	if (n%2!=0){

		printf("No\n");

	}

	else {

		int s=1;

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

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

				s=0;

			}

		}

			if(s){

				printf("Yes\n");

			}

			else{

				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.336848788441226x):
#include <stdio.h>

#include <string.h>

 

int main(){

	int n;

	scanf("%d", &n);

	

	char str[n+1];

	scanf("%s", &str);

	

	if (n%2!=0){

		printf("No\n");

	}

	else {

		int s=1;

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

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

				s=0;

			}

		}

			if(s){

				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.367615604956353x):
#include <stdio.h>

#include <string.h>



int main(){

 int i;

 scanf("%d", &i);

 

 char str[i+1];

 scanf("%s", &str);

 

 if (i%2!=0){

  printf("No\n");

 }

 else {

  int index=1;

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

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

    index=0;

   }

  }

   if(index){

    printf("Yes\n");

   }

   else{

    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.336848788441226x):
#include <stdio.h>

#include <string.h>



int main(){

 int i;

 scanf("%d", &i);

 

 char str[i+1];

 scanf("%s", &str);

 

 if (i%2!=0){

  printf("No\n");

 }

 else {

  int index=1;

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

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

    index=0;

   }

  }

   if(index){

    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.368690271042254x):
#include <stdio.h>

int main(){

	int N;

	scanf("%d", &N);

	char S[N];

	scanf("%s", S);

	if(N%2){

		printf("No");

		return 0;

	} else {

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

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

				

			}	else {

				printf("No");

				return 0;

			}

		}	

	}

	printf("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.337917294612425x):
#include <stdio.h>

int main(){

	int N;

	scanf("%d", &N);

	char S[N];

	scanf("%s", S);

	if(N%2){

		printf("No");

		return 0;

	} else {

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

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

				

			}	else {

				printf("No");

				return 0;

			}

		}	

	}

	printf("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.36763442015171x):
#include <stdio.h>



int main() {

	

	int n;

	scanf("%d", &n);

	

	char s[n];

	scanf("%s", s);

	

	if (n%2==1){

		printf("No\n");

		return 0;

	}

	

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

		if(s[i]!=s[j]){

			printf("No\n");

			return 0;

		}

	}



	printf("Yes\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.3368674957891304x):
#include <stdio.h>



int main() {

	

	int n;

	scanf("%d", &n);

	

	char s[n];

	scanf("%s", s);

	

	if (n%2==1){

		printf("No\n");

		return 0;

	}

	

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

		if(s[i]!=s[j]){

			printf("No\n");

			return 0;

		}

	}



	printf("Yes\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.365435771176377x):
#include<stdio.h>



int main()

{

	int n;

	int ctr[26] = {0}, flag = 1;

	

	scanf("%d", &n);

	

	char str[n + 1];

	

	scanf("%s", &str);

	

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

		if(str[i] >= 'a' && str[i] <= 'z'){

			++ctr[str[i] - 'a'];

		}

	}

	

	if(n % 2 != 0){

		printf("No\n");

		return 0;

	}else{

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

			if(ctr[i] > 0){

				if(ctr[i] % 2 != 0){

					flag = 0;

				}

			}

		}

	}

	if(flag == 1){

		printf("Yes\n");

	}else{

		printf("No\n");

	}

}
// 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.334681449323848x):
#include<stdio.h>



int main()

{

	int n;

	int ctr[26] = {0}, flag = 1;

	

	scanf("%d", &n);

	

	char str[n + 1];

	

	scanf("%s", &str);

	

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

		if(str[i] >= 'a' && str[i] <= 'z'){

			++ctr[str[i] - 'a'];

		}

	}

	

	if(n % 2 != 0){

		printf("No\n");

		return 0;

	}else{

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

			if(ctr[i] > 0){

				if(ctr[i] % 2 != 0){

					flag = 0;

				}

			}

		}

	}

	if(flag == 1){

		printf("Yes\n");

	}else{

		printf("No\n");

	}

}
// 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.367020011588449x):
#include<stdio.h>

#include<string.h>



int main(){

	int index;

	scanf("%d", &index);

	char string[index+2];

	scanf("%s", &string);

	//printf("string awal adalah %s\n", string);

	if(index%2==1){

		printf("No");

	}

	else{

		int flag=1;

		int i=0,j=0;

		for(i=0;i<=(index/2)-1;i++){

			j=(index/2)+i;

			if(string[i]==string[j]){

				flag=1;

//				printf("Huruf ke index %d adalah %c\n", i, string[i]);

//				printf("Huruf ke index %d adalah %c\n", j, string[j]);

//				printf("flag = %d\n", flag);

			}

			else{

				flag=0;

//				printf("Huruf ke index %d adalah %c\n", i, string[i]);

//				printf("Huruf ke index %d adalah %c\n", j, string[j]);

//				printf("flag = %d\n", flag);

				break;

			}

		}

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

	}

}
// 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.33625660897499x):
#include<stdio.h>

#include<string.h>



int main(){

	int index;

	scanf("%d", &index);

	char string[index+2];

	scanf("%s", &string);

	//printf("string awal adalah %s\n", string);

	if(index%2==1){

		printf("No");

	}

	else{

		int flag=1;

		int i=0,j=0;

		for(i=0;i<=(index/2)-1;i++){

			j=(index/2)+i;

			if(string[i]==string[j]){

				flag=1;

//				printf("Huruf ke index %d adalah %c\n", i, string[i]);

//				printf("Huruf ke index %d adalah %c\n", j, string[j]);

//				printf("flag = %d\n", flag);

			}

			else{

				flag=0;

//				printf("Huruf ke index %d adalah %c\n", i, string[i]);

//				printf("Huruf ke index %d adalah %c\n", j, string[j]);

//				printf("flag = %d\n", flag);

				break;

			}

		}

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

	}

}
// 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.360097726486076x):
#include <stdio.h>



int main() {

    int n, ct = 0;

    char s[105];

    scanf("%d", &n);

    scanf("%s", &s);

    if (n % 2 != 0) {

        printf("No");

        return 0;

    }

    int half = n / 2;

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

        if (s[i] == s[i + half]) {

            ct++;

        }

    }

    if (ct == half) {

        printf("Yes");

    } else {

        printf("No");

    }

}
// 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.329374001951542x):
#include <stdio.h>



int main() {

    int n, ct = 0;

    char s[105];

    scanf("%d", &n);

    scanf("%s", &s);

    if (n % 2 != 0) {

        printf("No");

        return 0;

    }

    int half = n / 2;

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

        if (s[i] == s[i + half]) {

            ct++;

        }

    }

    if (ct == half) {

        printf("Yes");

    } else {

        printf("No");

    }

}
// 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.36810491940719x):
#include <stdio.h>

 

int main(){

    int a;

    scanf("%d", &a);

    char str[a];

    scanf("%s", str);

    int flag = 1;

    if(a%2 != 0){

        flag = 0;

    }

    else{

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

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

                flag = 0;

                break;

            }

        }

    }

    

    flag ? 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.337335298174096x):
#include <stdio.h>

 

int main(){

    int a;

    scanf("%d", &a);

    char str[a];

    scanf("%s", str);

    int flag = 1;

    if(a%2 != 0){

        flag = 0;

    }

    else{

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

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

                flag = 0;

                break;

            }

        }

    }

    

    flag ? 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.368690271042254x):
#include <stdio.h>

 

int main () {

    int n;

    scanf("%d", &n);

    char s[n];

    scanf("%s", &s);

    

    if (n % 2 != 0) {

        printf("No");

        return 0;

    }

    

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

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

            printf("No");

            return 0;

        }

    }

    printf("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.337917294612425x):
#include <stdio.h>

 

int main () {

    int n;

    scanf("%d", &n);

    char s[n];

    scanf("%s", &s);

    

    if (n % 2 != 0) {

        printf("No");

        return 0;

    }

    

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

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

            printf("No");

            return 0;

        }

    }

    printf("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.3729399028381195x):
#include <stdio.h>



int main(){

    int n, ctr=0;

    scanf("%d", &n);

    char str[n];

    scanf("%s", str);



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

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

             ++ctr;

        }

    }

    if(n%2 == 1){

        puts("No");

    } else if (ctr == (n/2)){

        puts("Yes");

    } else {

        puts("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.342142567800792x):
#include <stdio.h>



int main(){

    int n, ctr=0;

    scanf("%d", &n);

    char str[n];

    scanf("%s", str);



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

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

             ++ctr;

        }

    }

    if(n%2 == 1){

        puts("No");

    } else if (ctr == (n/2)){

        puts("Yes");

    } else {

        puts("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, ctr = 0, i = 0;

	scanf("%d", &n);

	char str[n];

	scanf("%s", str);

	

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

		if (n % 2 != 0) {

			ctr++;

			break;

		} 

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

			i++;

		} else {

			ctr++;

			break;

		} 

	}

	ctr != 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, ctr = 0, i = 0;

	scanf("%d", &n);

	char str[n];

	scanf("%s", str);

	

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

		if (n % 2 != 0) {

			ctr++;

			break;

		} 

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

			i++;

		} else {

			ctr++;

			break;

		} 

	}

	ctr != 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.367378437727554x):
#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;

}