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



int main() {

	char a[10];

	scanf("%s", &a);

	

	(a[2] == a[3] && a[4] == a[5]) ? puts("Yes") : 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.281439296554085x):
#include <stdio.h>



int main() {

	char a[10];

	scanf("%s", &a);

	

	(a[2] == a[3] && a[4] == a[5]) ? puts("Yes") : 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.3440625166240645x):
#include <stdio.h>



int main() {

	char a[10];

	scanf("%s", &a);

	

	(a[2] == a[3] && a[4] == a[5]) ? puts("Yes") : 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.2792623025432714x):
#include <stdio.h>



int main() {

	char a[10];

	scanf("%s", &a);

	

	(a[2] == a[3] && a[4] == a[5]) ? puts("Yes") : 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.412604440964476x):
#include <stdio.h>



int main() {

	char a[10];

	scanf("%s", &a);

	

	(a[2] == a[3] && a[4] == a[5]) ? puts("Yes") : 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.328201440711101x):
#include <stdio.h>



int main() {

	char a[10];

	scanf("%s", &a);

	

	(a[2] == a[3] && a[4] == a[5]) ? puts("Yes") : 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.324706626885253x):
#include <stdio.h>



int main() {

	char a[10];

	scanf("%s", &a);

	

	(a[2] == a[3] && a[4] == a[5]) ? puts("Yes") : 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.287168355737708x):
#include <stdio.h>



int main() {

	char a[10];

	scanf("%s", &a);

	

	(a[2] == a[3] && a[4] == a[5]) ? puts("Yes") : 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.340863698610441x):
#include <stdio.h>



int main() {

	char a[10];

	scanf("%s", &a);

	

	(a[2] == a[3] && a[4] == a[5]) ? puts("Yes") : 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.343377477132538x):
#include <stdio.h>



int main() {

	char a[10];

	scanf("%s", &a);

	

	(a[2] == a[3] && a[4] == a[5]) ? puts("Yes") : 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.350311912180106x):
#include<stdio.h>



int main () {

	char c1, c2, c3, c4, c5, c6;

	scanf("%c%c%c%c%c%c", &c1, &c2, &c3, &c4, &c5, &c6);

	

	c3 == c4 && c5 == c6 ? puts("Yes") : 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" << endl;

	}

	else

	{

		cout << "No"<<endl;

	}

	return 0;

}

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



int main () {

	char c1, c2, c3, c4, c5, c6;

	scanf("%c%c%c%c%c%c", &c1, &c2, &c3, &c4, &c5, &c6);

	

	c3 == c4 && c5 == c6 ? puts("Yes") : 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.303355718855521x):
#include<stdio.h>



int main () {

	char c1, c2, c3, c4, c5, c6;

	scanf("%c%c%c%c%c%c", &c1, &c2, &c3, &c4, &c5, &c6);

	

	c3 == c4 && c5 == c6 ? puts("Yes") : 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.36623880690085x):
#include<stdio.h>



int main () {

	char c1, c2, c3, c4, c5, c6;

	scanf("%c%c%c%c%c%c", &c1, &c2, &c3, &c4, &c5, &c6);

	

	c3 == c4 && c5 == c6 ? puts("Yes") : 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.301169690958789x):
#include<stdio.h>



int main () {

	char c1, c2, c3, c4, c5, c6;

	scanf("%c%c%c%c%c%c", &c1, &c2, &c3, &c4, &c5, &c6);

	

	c3 == c4 && c5 == c6 ? puts("Yes") : 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.435065160101436x):
#include<stdio.h>



int main () {

	char c1, c2, c3, c4, c5, c6;

	scanf("%c%c%c%c%c%c", &c1, &c2, &c3, &c4, &c5, &c6);

	

	c3 == c4 && c5 == c6 ? puts("Yes") : 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.350311912180106x):
#include<stdio.h>



int main () {

	char c1, c2, c3, c4, c5, c6;

	scanf("%c%c%c%c%c%c", &c1, &c2, &c3, &c4, &c5, &c6);

	

	c3 == c4 && c5 == c6 ? puts("Yes") : 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.346802595903057x):
#include<stdio.h>



int main () {

	char c1, c2, c3, c4, c5, c6;

	scanf("%c%c%c%c%c%c", &c1, &c2, &c3, &c4, &c5, &c6);

	

	c3 == c4 && c5 == c6 ? puts("Yes") : 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.3091085519525425x):
#include<stdio.h>



int main () {

	char c1, c2, c3, c4, c5, c6;

	scanf("%c%c%c%c%c%c", &c1, &c2, &c3, &c4, &c5, &c6);

	

	c3 == c4 && c5 == c6 ? puts("Yes") : 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.363026714731734x):
#include<stdio.h>



int main () {

	char c1, c2, c3, c4, c5, c6;

	scanf("%c%c%c%c%c%c", &c1, &c2, &c3, &c4, &c5, &c6);

	

	c3 == c4 && c5 == c6 ? puts("Yes") : 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.3655509246965805x):
#include<stdio.h>



int main () {

	char c1, c2, c3, c4, c5, c6;

	scanf("%c%c%c%c%c%c", &c1, &c2, &c3, &c4, &c5, &c6);

	

	c3 == c4 && c5 == c6 ? puts("Yes") : 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.320129948663492x):
#include <stdio.h>



int main()

{

	char S[50];

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



int main()

{

	char S[50];

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



int main()

{

	char S[50];

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



int main()

{

	char S[50];

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



int main()

{

	char S[50];

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



int main()

{

	char S[50];

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



int main()

{

	char S[50];

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



int main()

{

	char S[50];

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



int main()

{

	char S[50];

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



int main()

{

	char S[50];

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



int main()

{

	char S[50];

		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>

#include <string.h>

int main () {

	char S[10];

	scanf("%s",S);

	((S[2]==S[3]) && (S[4]==S[5])) ? (printf("Yes\n")) : (printf("No\n")) ;

}
// 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>

#include <string.h>

int main () {

	char S[10];

	scanf("%s",S);

	((S[2]==S[3]) && (S[4]==S[5])) ? (printf("Yes\n")) : (printf("No\n")) ;

}
// 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>

#include <string.h>

int main () {

	char S[10];

	scanf("%s",S);

	((S[2]==S[3]) && (S[4]==S[5])) ? (printf("Yes\n")) : (printf("No\n")) ;

}
// 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>

#include <string.h>

int main () {

	char S[10];

	scanf("%s",S);

	((S[2]==S[3]) && (S[4]==S[5])) ? (printf("Yes\n")) : (printf("No\n")) ;

}
// 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>

#include <string.h>

int main () {

	char S[10];

	scanf("%s",S);

	((S[2]==S[3]) && (S[4]==S[5])) ? (printf("Yes\n")) : (printf("No\n")) ;

}
// 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>

#include <string.h>

int main () {

	char S[10];

	scanf("%s",S);

	((S[2]==S[3]) && (S[4]==S[5])) ? (printf("Yes\n")) : (printf("No\n")) ;

}
// 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>

#include <string.h>

int main () {

	char S[10];

	scanf("%s",S);

	((S[2]==S[3]) && (S[4]==S[5])) ? (printf("Yes\n")) : (printf("No\n")) ;

}
// 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>

#include <string.h>

int main () {

	char S[10];

	scanf("%s",S);

	((S[2]==S[3]) && (S[4]==S[5])) ? (printf("Yes\n")) : (printf("No\n")) ;

}
// 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>

#include <string.h>

int main () {

	char S[10];

	scanf("%s",S);

	((S[2]==S[3]) && (S[4]==S[5])) ? (printf("Yes\n")) : (printf("No\n")) ;

}
// 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>

#include <string.h>

int main () {

	char S[10];

	scanf("%s",S);

	((S[2]==S[3]) && (S[4]==S[5])) ? (printf("Yes\n")) : (printf("No\n")) ;

}
// 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>

#include <string.h>

int main () {

	char S[10];

	scanf("%s",S);

	((S[2]==S[3]) && (S[4]==S[5])) ? (printf("Yes\n")) : (printf("No\n")) ;

}
// 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.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;

	}