stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include <iostream>

using namespace std;

int main()

{

	string s;

	cin >> s;

	if (s[2] == s[3] && s[4]==s[5])

	{

		cout << "Yes" << endl;

	}

	else

	{

		cout << "No"<<endl;

	}

	return 0;

}

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





 int main(){

 char S[7];

 scanf("%s", &S);

 if(S[2]==S[3] && S[4] == S[5]){

 	puts("Yes");

 }

 else{

 	puts("No");

 }

 return 0;

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



using namespace std;



char c[6];



int main() {

    scanf("%s", c);

    if (c[2] == c[3] && c[4] == c[5])

        printf("Yes\n");

    else

        printf("No\n");

    return 0;

}

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





 int main(){

 char S[7];

 scanf("%s", &S);

 if(S[2]==S[3] && S[4] == S[5]){

 	puts("Yes");

 }

 else{

 	puts("No");

 }

 return 0;

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

#include <cstdio>

#include <cstring>

using namespace std;



string s;



int main(){

	cin>>s;

	if (s.length()==6){

		if (s[2]==s[3]&&s[4]==s[5]) {

			cout<<"Yes"<<endl;

			return 0;

		}

		

	}

	cout<<"No"<<endl;

	return 0; 

} 

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





 int main(){

 char S[7];

 scanf("%s", &S);

 if(S[2]==S[3] && S[4] == S[5]){

 	puts("Yes");

 }

 else{

 	puts("No");

 }

 return 0;

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

#include<cstring>

#include<iostream>

using namespace std;

#define ufor(i,l,r) for (int i=l;i<=r;i++)

#define MAXN 20000500



int main()

{

	char s[100000];

	scanf("%s",s);

	bool flag=(s[2]==s[3] && s[4] == s[5]);

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

		

	return 0;

}


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





 int main(){

 char S[7];

 scanf("%s", &S);

 if(S[2]==S[3] && S[4] == S[5]){

 	puts("Yes");

 }

 else{

 	puts("No");

 }

 return 0;

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

#include <string>

using namespace std;

int main(int argc, const char * argv[]) {

    ios::sync_with_stdio(false);

    string s;

    cin>>s;

    if (s.size()!=6) {

        

    }else{

        if (s[2]==s[3]&&s[4]==s[5]) {

            cout<<"Yes";

        }else{

            cout<<"No";

        }

    }

    

    return 0;

}


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





 int main(){

 char S[7];

 scanf("%s", &S);

 if(S[2]==S[3] && S[4] == S[5]){

 	puts("Yes");

 }

 else{

 	puts("No");

 }

 return 0;

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

using namespace std;

int main()

{

    string s;

    cin>>s;



    if(s[2] == s[3] && s[4] == s[5])

        cout<<"Yes";

    else

        cout<<"No";

    return 0;

}


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





 int main(){

 char S[7];

 scanf("%s", &S);

 if(S[2]==S[3] && S[4] == S[5]){

 	puts("Yes");

 }

 else{

 	puts("No");

 }

 return 0;

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

#include<string.h>



using namespace std;



int main()

{

    char line[7];

    for(int i=0;i<6;i++)

    {

        cin>>line[i];

        if(i==3)

        {

            if(line[i]!=line[i-1])

            {

               cout<<"No";

               return 0;

            }

        }

        else if(i==5)

        {

            if(line[i]!=line[i-1])

            {

               cout<<"No";

               return 0;

            }

        }

    }

    cout<<"Yes";

    return 0;

}




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





 int main(){

 char S[7];

 scanf("%s", &S);

 if(S[2]==S[3] && S[4] == S[5]){

 	puts("Yes");

 }

 else{

 	puts("No");

 }

 return 0;

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

#include <stdlib.h>

#include <string.h>



using namespace std;



int main()

{

    char str[80];

    cin>>str;

    if((str[2]==str[3]) && (str[4]==str[5]))

       cout<<"Yes";

    else

        cout<<"No";



    return 0;

}


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





 int main(){

 char S[7];

 scanf("%s", &S);

 if(S[2]==S[3] && S[4] == S[5]){

 	puts("Yes");

 }

 else{

 	puts("No");

 }

 return 0;

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

using namespace std;

int main()

{

    string s;

    cin >> s;

    if(s[2]==s[3] && s[4]==s[5])

    {

        cout << "Yes" << endl;

    }

    else cout << "No" << endl;

}


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





 int main(){

 char S[7];

 scanf("%s", &S);

 if(S[2]==S[3] && S[4] == S[5]){

 	puts("Yes");

 }

 else{

 	puts("No");

 }

 return 0;

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

using namespace std;

int main()

{

    char S[7];

    cin >> S;

    if(S[2]== S[3]) {

        if(S[4]==S[5]){

       cout << "Yes" << endl;

        }

        else cout << "No" << endl;

     }

    else cout << "No" << endl;

    return 0;

}

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





 int main(){

 char S[7];

 scanf("%s", &S);

 if(S[2]==S[3] && S[4] == S[5]){

 	puts("Yes");

 }

 else{

 	puts("No");

 }

 return 0;

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

#define Tayeb ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)

typedef long long ll;

using namespace std;

int main()

{

    Tayeb;

    string s;

    cin >> s;



    if(s[2]==s[3]&&s[4]==s[5])

    cout << "Yes\n";

    else

    cout << "No\n";



    return 0;



}


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





 int main(){

 char S[7];

 scanf("%s", &S);

 if(S[2]==S[3] && S[4] == S[5]){

 	puts("Yes");

 }

 else{

 	puts("No");

 }

 return 0;

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

using namespace std;

int main()

{

   string s;

   cin>>s;

   if(s[2]==s[3]&&s[4]==s[5]){

    cout<<"Yes";

   }

   else{

    cout<<"No";

   }

}


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

int main()

{

	char S[6];

	scanf("%s",&S);

	

	if(S[2]==S[3] && S[4]==S[5])

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	return 0;

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

using namespace std;

int main()

{

	string s;

	cin >> s;

	if (s[2] == s[3] && s[4]==s[5])

	{

		cout << "Yes" << endl;

	}

	else

	{

		cout << "No"<<endl;

	}

	return 0;

}

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

int main()

{

	char S[6];

	scanf("%s",&S);

	

	if(S[2]==S[3] && S[4]==S[5])

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	return 0;

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



using namespace std;



char c[6];



int main() {

    scanf("%s", c);

    if (c[2] == c[3] && c[4] == c[5])

        printf("Yes\n");

    else

        printf("No\n");

    return 0;

}

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

int main()

{

	char S[6];

	scanf("%s",&S);

	

	if(S[2]==S[3] && S[4]==S[5])

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	return 0;

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

#include <cstdio>

#include <cstring>

using namespace std;



string s;



int main(){

	cin>>s;

	if (s.length()==6){

		if (s[2]==s[3]&&s[4]==s[5]) {

			cout<<"Yes"<<endl;

			return 0;

		}

		

	}

	cout<<"No"<<endl;

	return 0; 

} 

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

int main()

{

	char S[6];

	scanf("%s",&S);

	

	if(S[2]==S[3] && S[4]==S[5])

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	return 0;

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

#include<cstring>

#include<iostream>

using namespace std;

#define ufor(i,l,r) for (int i=l;i<=r;i++)

#define MAXN 20000500



int main()

{

	char s[100000];

	scanf("%s",s);

	bool flag=(s[2]==s[3] && s[4] == s[5]);

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

		

	return 0;

}


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

int main()

{

	char S[6];

	scanf("%s",&S);

	

	if(S[2]==S[3] && S[4]==S[5])

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	return 0;

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

#include <string>

using namespace std;

int main(int argc, const char * argv[]) {

    ios::sync_with_stdio(false);

    string s;

    cin>>s;

    if (s.size()!=6) {

        

    }else{

        if (s[2]==s[3]&&s[4]==s[5]) {

            cout<<"Yes";

        }else{

            cout<<"No";

        }

    }

    

    return 0;

}


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

int main()

{

	char S[6];

	scanf("%s",&S);

	

	if(S[2]==S[3] && S[4]==S[5])

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	return 0;

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

using namespace std;

int main()

{

    string s;

    cin>>s;



    if(s[2] == s[3] && s[4] == s[5])

        cout<<"Yes";

    else

        cout<<"No";

    return 0;

}


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

int main()

{

	char S[6];

	scanf("%s",&S);

	

	if(S[2]==S[3] && S[4]==S[5])

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	return 0;

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

#include<string.h>



using namespace std;



int main()

{

    char line[7];

    for(int i=0;i<6;i++)

    {

        cin>>line[i];

        if(i==3)

        {

            if(line[i]!=line[i-1])

            {

               cout<<"No";

               return 0;

            }

        }

        else if(i==5)

        {

            if(line[i]!=line[i-1])

            {

               cout<<"No";

               return 0;

            }

        }

    }

    cout<<"Yes";

    return 0;

}




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

int main()

{

	char S[6];

	scanf("%s",&S);

	

	if(S[2]==S[3] && S[4]==S[5])

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	return 0;

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

#include <stdlib.h>

#include <string.h>



using namespace std;



int main()

{

    char str[80];

    cin>>str;

    if((str[2]==str[3]) && (str[4]==str[5]))

       cout<<"Yes";

    else

        cout<<"No";



    return 0;

}


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

int main()

{

	char S[6];

	scanf("%s",&S);

	

	if(S[2]==S[3] && S[4]==S[5])

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	return 0;

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

using namespace std;

int main()

{

    string s;

    cin >> s;

    if(s[2]==s[3] && s[4]==s[5])

    {

        cout << "Yes" << endl;

    }

    else cout << "No" << endl;

}


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

int main()

{

	char S[6];

	scanf("%s",&S);

	

	if(S[2]==S[3] && S[4]==S[5])

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	return 0;

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

using namespace std;

int main()

{

    char S[7];

    cin >> S;

    if(S[2]== S[3]) {

        if(S[4]==S[5]){

       cout << "Yes" << endl;

        }

        else cout << "No" << endl;

     }

    else cout << "No" << endl;

    return 0;

}

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

int main()

{

	char S[6];

	scanf("%s",&S);

	

	if(S[2]==S[3] && S[4]==S[5])

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	return 0;

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

#define Tayeb ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)

typedef long long ll;

using namespace std;

int main()

{

    Tayeb;

    string s;

    cin >> s;



    if(s[2]==s[3]&&s[4]==s[5])

    cout << "Yes\n";

    else

    cout << "No\n";



    return 0;



}


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

int main()

{

	char S[6];

	scanf("%s",&S);

	

	if(S[2]==S[3] && S[4]==S[5])

	{

		printf("Yes");

	}

	else

	{

		printf("No");

	}

	return 0;

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

using namespace std;

int main()

{

   string s;

   cin>>s;

   if(s[2]==s[3]&&s[4]==s[5]){

    cout<<"Yes";

   }

   else{

    cout<<"No";

   }

}


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



int main(){

	char a[10];

	scanf("%s", &a);

	

	if(a[2]==a[3] && a[4]==a[5]){

		printf("Yes\n");

	}else{

		printf("No\n");

	}

	return 0;

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

using namespace std;

int main()

{

	string s;

	cin >> s;

	if (s[2] == s[3] && s[4]==s[5])

	{

		cout << "Yes" << endl;

	}

	else

	{

		cout << "No"<<endl;

	}

	return 0;

}

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



int main(){

	char a[10];

	scanf("%s", &a);

	

	if(a[2]==a[3] && a[4]==a[5]){

		printf("Yes\n");

	}else{

		printf("No\n");

	}

	return 0;

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



using namespace std;



char c[6];



int main() {

    scanf("%s", c);

    if (c[2] == c[3] && c[4] == c[5])

        printf("Yes\n");

    else

        printf("No\n");

    return 0;

}

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



int main(){

	char a[10];

	scanf("%s", &a);

	

	if(a[2]==a[3] && a[4]==a[5]){

		printf("Yes\n");

	}else{

		printf("No\n");

	}

	return 0;

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

#include <cstdio>

#include <cstring>

using namespace std;



string s;



int main(){

	cin>>s;

	if (s.length()==6){

		if (s[2]==s[3]&&s[4]==s[5]) {

			cout<<"Yes"<<endl;

			return 0;

		}

		

	}

	cout<<"No"<<endl;

	return 0; 

} 

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



int main(){

	char a[10];

	scanf("%s", &a);

	

	if(a[2]==a[3] && a[4]==a[5]){

		printf("Yes\n");

	}else{

		printf("No\n");

	}

	return 0;

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

#include<cstring>

#include<iostream>

using namespace std;

#define ufor(i,l,r) for (int i=l;i<=r;i++)

#define MAXN 20000500



int main()

{

	char s[100000];

	scanf("%s",s);

	bool flag=(s[2]==s[3] && s[4] == s[5]);

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

		

	return 0;

}


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



int main(){

	char a[10];

	scanf("%s", &a);

	

	if(a[2]==a[3] && a[4]==a[5]){

		printf("Yes\n");

	}else{

		printf("No\n");

	}

	return 0;

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

#include <string>

using namespace std;

int main(int argc, const char * argv[]) {

    ios::sync_with_stdio(false);

    string s;

    cin>>s;

    if (s.size()!=6) {

        

    }else{

        if (s[2]==s[3]&&s[4]==s[5]) {

            cout<<"Yes";

        }else{

            cout<<"No";

        }

    }

    

    return 0;

}


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



int main(){

	char a[10];

	scanf("%s", &a);

	

	if(a[2]==a[3] && a[4]==a[5]){

		printf("Yes\n");

	}else{

		printf("No\n");

	}

	return 0;

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

using namespace std;

int main()

{

    string s;

    cin>>s;



    if(s[2] == s[3] && s[4] == s[5])

        cout<<"Yes";

    else

        cout<<"No";

    return 0;

}


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



int main(){

	char a[10];

	scanf("%s", &a);

	

	if(a[2]==a[3] && a[4]==a[5]){

		printf("Yes\n");

	}else{

		printf("No\n");

	}

	return 0;

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

#include<string.h>



using namespace std;



int main()

{

    char line[7];

    for(int i=0;i<6;i++)

    {

        cin>>line[i];

        if(i==3)

        {

            if(line[i]!=line[i-1])

            {

               cout<<"No";

               return 0;

            }

        }

        else if(i==5)

        {

            if(line[i]!=line[i-1])

            {

               cout<<"No";

               return 0;

            }

        }

    }

    cout<<"Yes";

    return 0;

}




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



int main(){

	char a[10];

	scanf("%s", &a);

	

	if(a[2]==a[3] && a[4]==a[5]){

		printf("Yes\n");

	}else{

		printf("No\n");

	}

	return 0;

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

#include <stdlib.h>

#include <string.h>



using namespace std;



int main()

{

    char str[80];

    cin>>str;

    if((str[2]==str[3]) && (str[4]==str[5]))

       cout<<"Yes";

    else

        cout<<"No";



    return 0;

}


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



int main(){

	char a[10];

	scanf("%s", &a);

	

	if(a[2]==a[3] && a[4]==a[5]){

		printf("Yes\n");

	}else{

		printf("No\n");

	}

	return 0;

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

using namespace std;

int main()

{

    string s;

    cin >> s;

    if(s[2]==s[3] && s[4]==s[5])

    {

        cout << "Yes" << endl;

    }

    else cout << "No" << endl;

}


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



int main(){

	char a[10];

	scanf("%s", &a);

	

	if(a[2]==a[3] && a[4]==a[5]){

		printf("Yes\n");

	}else{

		printf("No\n");

	}

	return 0;

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

using namespace std;

int main()

{

    char S[7];

    cin >> S;

    if(S[2]== S[3]) {

        if(S[4]==S[5]){

       cout << "Yes" << endl;

        }

        else cout << "No" << endl;

     }

    else cout << "No" << endl;

    return 0;

}

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



int main(){

	char a[10];

	scanf("%s", &a);

	

	if(a[2]==a[3] && a[4]==a[5]){

		printf("Yes\n");

	}else{

		printf("No\n");

	}

	return 0;

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

#define Tayeb ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)

typedef long long ll;

using namespace std;

int main()

{

    Tayeb;

    string s;

    cin >> s;



    if(s[2]==s[3]&&s[4]==s[5])

    cout << "Yes\n";

    else

    cout << "No\n";



    return 0;



}


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



int main(){

	char a[10];

	scanf("%s", &a);

	

	if(a[2]==a[3] && a[4]==a[5]){

		printf("Yes\n");

	}else{

		printf("No\n");

	}

	return 0;

}
// Slower C++ solution:


#include <algorithm>

#include <array>

#include <bitset>

#include <cassert>

#include <chrono>

#include <cmath>

#include <complex>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <ctime>

#include <iostream>

#include <map>

#include <math.h>

#include <queue>

#include <random>

#include <set>

#include <string>

#include <thread>

#include <unordered_map>

#include <unordered_set>

#include <vector>

#include <stack>



using namespace std;



//////////////////////////////////////////////////////////////////////////

/* Custom function starts here */



/* Custom function ends here: */

//////////////////////////////////////////////////////////////////////////////



int main() {





  /* MAIN Code STARTS here: */

    string s;

    cin >> s;

    if(s[2] == s[3] && s[4] == s[5]){

        cout << "Yes" << endl;

    }

    else{

        cout << "No" << endl;

    }

  /* MAIN Code ENDS here: */

 

}

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



int main(){

	char a[10];

	scanf("%s", &a);

	

	if(a[2]==a[3] && a[4]==a[5]){

		printf("Yes\n");

	}else{

		printf("No\n");

	}

	return 0;

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

using namespace std;

int main()

{

   string s;

   cin>>s;

   if(s[2]==s[3]&&s[4]==s[5]){

    cout<<"Yes";

   }

   else{

    cout<<"No";

   }

}


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



int main(){

 char S[10];

 scanf("%s",&S);

 if(S[2]==S[3] && S[4]==S[5]){

 	printf("Yes");

 }

 else {

 	printf("No");

 }

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

using namespace std;

int main()

{

	string s;

	cin >> s;

	if (s[2] == s[3] && s[4]==s[5])

	{

		cout << "Yes" << endl;

	}

	else

	{

		cout << "No"<<endl;

	}

	return 0;

}

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



int main(){

 char S[10];

 scanf("%s",&S);

 if(S[2]==S[3] && S[4]==S[5]){

 	printf("Yes");

 }

 else {

 	printf("No");

 }

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



using namespace std;



char c[6];



int main() {

    scanf("%s", c);

    if (c[2] == c[3] && c[4] == c[5])

        printf("Yes\n");

    else

        printf("No\n");

    return 0;

}

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



int main(){

 char S[10];

 scanf("%s",&S);

 if(S[2]==S[3] && S[4]==S[5]){

 	printf("Yes");

 }

 else {

 	printf("No");

 }

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

#include <cstdio>

#include <cstring>

using namespace std;



string s;



int main(){

	cin>>s;

	if (s.length()==6){

		if (s[2]==s[3]&&s[4]==s[5]) {

			cout<<"Yes"<<endl;

			return 0;

		}

		

	}

	cout<<"No"<<endl;

	return 0; 

} 

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



int main(){

 char S[10];

 scanf("%s",&S);

 if(S[2]==S[3] && S[4]==S[5]){

 	printf("Yes");

 }

 else {

 	printf("No");

 }

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

#include<cstring>

#include<iostream>

using namespace std;

#define ufor(i,l,r) for (int i=l;i<=r;i++)

#define MAXN 20000500



int main()

{

	char s[100000];

	scanf("%s",s);

	bool flag=(s[2]==s[3] && s[4] == s[5]);

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

		

	return 0;

}


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



int main(){

 char S[10];

 scanf("%s",&S);

 if(S[2]==S[3] && S[4]==S[5]){

 	printf("Yes");

 }

 else {

 	printf("No");

 }

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

#include <string>

using namespace std;

int main(int argc, const char * argv[]) {

    ios::sync_with_stdio(false);

    string s;

    cin>>s;

    if (s.size()!=6) {

        

    }else{

        if (s[2]==s[3]&&s[4]==s[5]) {

            cout<<"Yes";

        }else{

            cout<<"No";

        }

    }

    

    return 0;

}


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



int main(){

 char S[10];

 scanf("%s",&S);

 if(S[2]==S[3] && S[4]==S[5]){

 	printf("Yes");

 }

 else {

 	printf("No");

 }

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

using namespace std;

int main()

{

    string s;

    cin>>s;



    if(s[2] == s[3] && s[4] == s[5])

        cout<<"Yes";

    else

        cout<<"No";

    return 0;

}


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



int main(){

 char S[10];

 scanf("%s",&S);

 if(S[2]==S[3] && S[4]==S[5]){

 	printf("Yes");

 }

 else {

 	printf("No");

 }

}