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



int main(){

	char S[15];

	

	scanf("%s", S);

	

	S[2]==S[3] && S[4]== S[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.286510221674782x):
#include <stdio.h>



int main(){

	char S[15];

	

	scanf("%s", S);

	

	S[2]==S[3] && S[4]== S[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.349193568850644x):
#include <stdio.h>



int main(){

	char S[15];

	

	scanf("%s", S);

	

	S[2]==S[3] && S[4]== S[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.284331137443293x):
#include <stdio.h>



int main(){

	char S[15];

	

	scanf("%s", S);

	

	S[2]==S[3] && S[4]== S[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.417801303086131x):
#include <stdio.h>



int main(){

	char S[15];

	

	scanf("%s", S);

	

	S[2]==S[3] && S[4]== S[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.333317264072257x):
#include <stdio.h>



int main(){

	char S[15];

	

	scanf("%s", S);

	

	S[2]==S[3] && S[4]== S[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.329819094733219x):
#include <stdio.h>



int main(){

	char S[15];

	

	scanf("%s", S);

	

	S[2]==S[3] && S[4]== S[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.292244781561624x):
#include <stdio.h>



int main(){

	char S[15];

	

	scanf("%s", S);

	

	S[2]==S[3] && S[4]== S[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.3459916795214735x):
#include <stdio.h>



int main(){

	char S[15];

	

	scanf("%s", S);

	

	S[2]==S[3] && S[4]== S[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.348507871624782x):
#include <stdio.h>



int main(){

	char S[15];

	

	scanf("%s", S);

	

	S[2]==S[3] && S[4]== S[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.332204416915686x):
#include <stdio.h>

int main(){

	char a[8];

	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" << endl;

	}

	else

	{

		cout << "No"<<endl;

	}

	return 0;

}

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

int main(){

	char a[8];

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

int main(){

	char a[8];

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

int main(){

	char a[8];

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

int main(){

	char a[8];

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

int main(){

	char a[8];

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

int main(){

	char a[8];

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

int main(){

	char a[8];

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

int main(){

	char a[8];

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

int main(){

	char a[8];

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

int main(){

	char a[8];

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

typedef long long int lli;

int main() {

  char s[6];

  scanf("%s", &s);

 

  if(s[2]==s[3] && s[4]==s[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.330857132998472x):
#include<stdio.h>

typedef long long int lli;

int main() {

  char s[6];

  scanf("%s", &s);

 

  if(s[2]==s[3] && s[4]==s[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.271544067649376x):
#include<stdio.h>

typedef long long int lli;

int main() {

  char s[6];

  scanf("%s", &s);

 

  if(s[2]==s[3] && s[4]==s[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.334049957752551x):
#include<stdio.h>

typedef long long int lli;

int main() {

  char s[6];

  scanf("%s", &s);

 

  if(s[2]==s[3] && s[4]==s[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.269371152423313x):
#include<stdio.h>

typedef long long int lli;

int main() {

  char s[6];

  scanf("%s", &s);

 

  if(s[2]==s[3] && s[4]==s[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.4024634629267405x):
#include<stdio.h>

typedef long long int lli;

int main() {

  char s[6];

  scanf("%s", &s);

 

  if(s[2]==s[3] && s[4]==s[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.318218598923894x):
#include<stdio.h>

typedef long long int lli;

int main() {

  char s[6];

  scanf("%s", &s);

 

  if(s[2]==s[3] && s[4]==s[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.314730332931098x):
#include<stdio.h>

typedef long long int lli;

int main() {

  char s[6];

  scanf("%s", &s);

 

  if(s[2]==s[3] && s[4]==s[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.277262392949895x):
#include<stdio.h>

typedef long long int lli;

int main() {

  char s[6];

  scanf("%s", &s);

 

  if(s[2]==s[3] && s[4]==s[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.330857132998472x):
#include<stdio.h>

typedef long long int lli;

int main() {

  char s[6];

  scanf("%s", &s);

 

  if(s[2]==s[3] && s[4]==s[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.33336620174119x):
#include<stdio.h>

typedef long long int lli;

int main() {

  char s[6];

  scanf("%s", &s);

 

  if(s[2]==s[3] && s[4]==s[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.32041025036368x):
#include <stdio.h>

int main(){

	char coffee[21];

	scanf("%s", coffee);

	if(coffee[2] == coffee[3] && coffee[4] == coffee[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.333053992810363x):
#include <stdio.h>

int main(){

	char coffee[21];

	scanf("%s", coffee);

	if(coffee[2] == coffee[3] && coffee[4] == coffee[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.273716484395859x):
#include <stdio.h>

int main(){

	char coffee[21];

	scanf("%s", coffee);

	if(coffee[2] == coffee[3] && coffee[4] == coffee[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.336248133335662x):
#include <stdio.h>

int main(){

	char coffee[21];

	scanf("%s", coffee);

	if(coffee[2] == coffee[3] && coffee[4] == coffee[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.271542673705892x):
#include <stdio.h>

int main(){

	char coffee[21];

	scanf("%s", coffee);

	if(coffee[2] == coffee[3] && coffee[4] == coffee[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.404689831889707x):
#include <stdio.h>

int main(){

	char coffee[21];

	scanf("%s", coffee);

	if(coffee[2] == coffee[3] && coffee[4] == coffee[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.32041025036368x):
#include <stdio.h>

int main(){

	char coffee[21];

	scanf("%s", coffee);

	if(coffee[2] == coffee[3] && coffee[4] == coffee[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.316920546847577x):
#include <stdio.h>

int main(){

	char coffee[21];

	scanf("%s", coffee);

	if(coffee[2] == coffee[3] && coffee[4] == coffee[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.2794371662328095x):
#include <stdio.h>

int main(){

	char coffee[21];

	scanf("%s", coffee);

	if(coffee[2] == coffee[3] && coffee[4] == coffee[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.333053992810363x):
#include <stdio.h>

int main(){

	char coffee[21];

	scanf("%s", coffee);

	if(coffee[2] == coffee[3] && coffee[4] == coffee[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.3355640955467045x):
#include <stdio.h>

int main(){

	char coffee[21];

	scanf("%s", coffee);

	if(coffee[2] == coffee[3] && coffee[4] == coffee[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.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;

}