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

#include<vector>

#include<algorithm>

#include<set>

#include<map>

#include<queue>

#include<deque>

#include<algorithm>

#include<math.h>

using namespace std;



int main()

{

string s ; cin>>s;

if(s.length()<5)

{

    cout<<"No";

    return 0;

}

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

{

    cout<<"Yes";

    return 0 ;

}

cout<<"No";

       return 0;

}


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



int main(){

char S[100];

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 x = 1;

	string s;

	cin>> s;

	for(int i = 0;i < s.length();i++) {

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

			cout << "Yes";

			break;

		}

		else {

			cout << "No";

			break;

		}

	}

	

	return 0;

}


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



int main(){

char S[100];

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() {

    ios::sync_with_stdio(false); cin.tie(0);

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



int main(){

char S[100];

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 str;

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



int main(){

char S[100];

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()

{

    

	ios_base::sync_with_stdio(false); cin.tie(NULL);

 



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



int main(){

char S[100];

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>

#define endl  "\n"

#define ll long long

#define PI acos(-1.0)

#define test cout<<"\n****\n"

#define precise fixed(cout);cout<<setprecision(12)

#define fast  ios_base :: sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)

using  namespace  std;





int main(){



    string str;

    cin>>str;



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

        cout<<"Yes\n";

    }

    else{

        cout<<"No\n";

    }

    return 0;

}

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



int main(){

char S[100];

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>

#define ll long long

#define endl "\n"

#define mset(arr, val) memset((arr), (val), sizeof(arr))

#define For(i, init, n) for (int64_t (i) = (init); (i) < (n); (i)++)

#define ___ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

using namespace std;



// const double PI = acos(-1.0), E = exp(1.0), EPS = 1e-9;

const int MOD = (int)1e9 + 7, N = (int)1e5;



int main()

{   

#ifdef MY_PREPROCESSOR

    freopen("in.txt", "r", stdin);

    freopen("out.txt", "w", stdout);

#endif

    ___

    

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



int main(){

char S[100];

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<vector>

#include<algorithm>

#include<set>

#include<map>

#include<queue>

#include<deque>

#include<algorithm>

#include<math.h>

using namespace std;



int main()

{

string s ; cin>>s;

if(s.length()<5)

{

    cout<<"No";

    return 0;

}

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

{

    cout<<"Yes";

    return 0 ;

}

cout<<"No";

       return 0;

}


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

int main()

{

	char str[11];

	scanf("%s", str);

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

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

return 0;

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

#include<string>

using namespace std;

int main()

{

	int x = 1;

	string s;

	cin>> s;

	for(int i = 0;i < s.length();i++) {

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

			cout << "Yes";

			break;

		}

		else {

			cout << "No";

			break;

		}

	}

	

	return 0;

}


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

int main()

{

	char str[11];

	scanf("%s", str);

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

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

return 0;

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



using namespace std;



int main() {

    ios::sync_with_stdio(false); cin.tie(0);

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

int main()

{

	char str[11];

	scanf("%s", str);

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

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

return 0;

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

using namespace std; 



int main() {

     string str;

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

int main()

{

	char str[11];

	scanf("%s", str);

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

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

return 0;

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

using namespace std;







int main()

{

    

	ios_base::sync_with_stdio(false); cin.tie(NULL);

 



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

int main()

{

	char str[11];

	scanf("%s", str);

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

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

return 0;

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

#define endl  "\n"

#define ll long long

#define PI acos(-1.0)

#define test cout<<"\n****\n"

#define precise fixed(cout);cout<<setprecision(12)

#define fast  ios_base :: sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)

using  namespace  std;





int main(){



    string str;

    cin>>str;



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

        cout<<"Yes\n";

    }

    else{

        cout<<"No\n";

    }

    return 0;

}

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

int main()

{

	char str[11];

	scanf("%s", str);

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

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

return 0;

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

#define ll long long

#define endl "\n"

#define mset(arr, val) memset((arr), (val), sizeof(arr))

#define For(i, init, n) for (int64_t (i) = (init); (i) < (n); (i)++)

#define ___ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

using namespace std;



// const double PI = acos(-1.0), E = exp(1.0), EPS = 1e-9;

const int MOD = (int)1e9 + 7, N = (int)1e5;



int main()

{   

#ifdef MY_PREPROCESSOR

    freopen("in.txt", "r", stdin);

    freopen("out.txt", "w", stdout);

#endif

    ___

    

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

int main()

{

	char str[11];

	scanf("%s", str);

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

		printf("Yes\n");

	}

	else{

		printf("No\n");

	}

return 0;

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

#include<vector>

#include<algorithm>

#include<set>

#include<map>

#include<queue>

#include<deque>

#include<algorithm>

#include<math.h>

using namespace std;



int main()

{

string s ; cin>>s;

if(s.length()<5)

{

    cout<<"No";

    return 0;

}

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

{

    cout<<"Yes";

    return 0 ;

}

cout<<"No";

       return 0;

}


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



int main()

{

    char S[20];

    scanf("%s", &S);

    getchar();

    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 x = 1;

	string s;

	cin>> s;

	for(int i = 0;i < s.length();i++) {

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

			cout << "Yes";

			break;

		}

		else {

			cout << "No";

			break;

		}

	}

	

	return 0;

}


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



int main()

{

    char S[20];

    scanf("%s", &S);

    getchar();

    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() {

    ios::sync_with_stdio(false); cin.tie(0);

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



int main()

{

    char S[20];

    scanf("%s", &S);

    getchar();

    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 str;

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



int main()

{

    char S[20];

    scanf("%s", &S);

    getchar();

    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()

{

    

	ios_base::sync_with_stdio(false); cin.tie(NULL);

 



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



int main()

{

    char S[20];

    scanf("%s", &S);

    getchar();

    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>

#define endl  "\n"

#define ll long long

#define PI acos(-1.0)

#define test cout<<"\n****\n"

#define precise fixed(cout);cout<<setprecision(12)

#define fast  ios_base :: sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)

using  namespace  std;





int main(){



    string str;

    cin>>str;



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

        cout<<"Yes\n";

    }

    else{

        cout<<"No\n";

    }

    return 0;

}

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



int main()

{

    char S[20];

    scanf("%s", &S);

    getchar();

    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>

#define ll long long

#define endl "\n"

#define mset(arr, val) memset((arr), (val), sizeof(arr))

#define For(i, init, n) for (int64_t (i) = (init); (i) < (n); (i)++)

#define ___ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

using namespace std;



// const double PI = acos(-1.0), E = exp(1.0), EPS = 1e-9;

const int MOD = (int)1e9 + 7, N = (int)1e5;



int main()

{   

#ifdef MY_PREPROCESSOR

    freopen("in.txt", "r", stdin);

    freopen("out.txt", "w", stdout);

#endif

    ___

    

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



int main()

{

    char S[20];

    scanf("%s", &S);

    getchar();

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

    {

        printf("Yes\n");

    }

    else

    {

        printf("No\n");

    }

    return 0;

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

#include<vector>

#include<algorithm>

#include<set>

#include<map>

#include<queue>

#include<deque>

#include<algorithm>

#include<math.h>

using namespace std;



int main()

{

string s ; cin>>s;

if(s.length()<5)

{

    cout<<"No";

    return 0;

}

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

{

    cout<<"Yes";

    return 0 ;

}

cout<<"No";

       return 0;

}


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



int main()

{

	char s[10];

	scanf("%s", &s);

//ex : coffee berarti f pertama = berindeks 2

					//f kedua = index 3

					//e pertama= index 4

					//e kedua = index ke 5

					//c adalah index ke 0

	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 x = 1;

	string s;

	cin>> s;

	for(int i = 0;i < s.length();i++) {

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

			cout << "Yes";

			break;

		}

		else {

			cout << "No";

			break;

		}

	}

	

	return 0;

}


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



int main()

{

	char s[10];

	scanf("%s", &s);

//ex : coffee berarti f pertama = berindeks 2

					//f kedua = index 3

					//e pertama= index 4

					//e kedua = index ke 5

					//c adalah index ke 0

	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() {

    ios::sync_with_stdio(false); cin.tie(0);

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



int main()

{

	char s[10];

	scanf("%s", &s);

//ex : coffee berarti f pertama = berindeks 2

					//f kedua = index 3

					//e pertama= index 4

					//e kedua = index ke 5

					//c adalah index ke 0

	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 str;

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



int main()

{

	char s[10];

	scanf("%s", &s);

//ex : coffee berarti f pertama = berindeks 2

					//f kedua = index 3

					//e pertama= index 4

					//e kedua = index ke 5

					//c adalah index ke 0

	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()

{

    

	ios_base::sync_with_stdio(false); cin.tie(NULL);

 



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



int main()

{

	char s[10];

	scanf("%s", &s);

//ex : coffee berarti f pertama = berindeks 2

					//f kedua = index 3

					//e pertama= index 4

					//e kedua = index ke 5

					//c adalah index ke 0

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

		puts("Yes");

		

	}	else

		puts("No");

	

	return 0;



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

#define endl  "\n"

#define ll long long

#define PI acos(-1.0)

#define test cout<<"\n****\n"

#define precise fixed(cout);cout<<setprecision(12)

#define fast  ios_base :: sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)

using  namespace  std;





int main(){



    string str;

    cin>>str;



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

        cout<<"Yes\n";

    }

    else{

        cout<<"No\n";

    }

    return 0;

}

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



int main()

{

	char s[10];

	scanf("%s", &s);

//ex : coffee berarti f pertama = berindeks 2

					//f kedua = index 3

					//e pertama= index 4

					//e kedua = index ke 5

					//c adalah index ke 0

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

		puts("Yes");

		

	}	else

		puts("No");

	

	return 0;



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

#define ll long long

#define endl "\n"

#define mset(arr, val) memset((arr), (val), sizeof(arr))

#define For(i, init, n) for (int64_t (i) = (init); (i) < (n); (i)++)

#define ___ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

using namespace std;



// const double PI = acos(-1.0), E = exp(1.0), EPS = 1e-9;

const int MOD = (int)1e9 + 7, N = (int)1e5;



int main()

{   

#ifdef MY_PREPROCESSOR

    freopen("in.txt", "r", stdin);

    freopen("out.txt", "w", stdout);

#endif

    ___

    

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



int main()

{

	char s[10];

	scanf("%s", &s);

//ex : coffee berarti f pertama = berindeks 2

					//f kedua = index 3

					//e pertama= index 4

					//e kedua = index ke 5

					//c adalah index ke 0

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

		puts("Yes");

		

	}	else

		puts("No");

	

	return 0;



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

#include<vector>

#include<algorithm>

#include<set>

#include<map>

#include<queue>

#include<deque>

#include<algorithm>

#include<math.h>

using namespace std;



int main()

{

string s ; cin>>s;

if(s.length()<5)

{

    cout<<"No";

    return 0;

}

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

{

    cout<<"Yes";

    return 0 ;

}

cout<<"No";

       return 0;

}


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



int main(){

	char a[10];

	scanf("%s", &a);

	

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

		puts("Yes");

	}

	else

	puts("No");

	

	return 0;

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

#include<string>

using namespace std;

int main()

{

	int x = 1;

	string s;

	cin>> s;

	for(int i = 0;i < s.length();i++) {

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

			cout << "Yes";

			break;

		}

		else {

			cout << "No";

			break;

		}

	}

	

	return 0;

}


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



int main(){

	char a[10];

	scanf("%s", &a);

	

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

		puts("Yes");

	}

	else

	puts("No");

	

	return 0;

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



using namespace std;



int main() {

    ios::sync_with_stdio(false); cin.tie(0);

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



int main(){

	char a[10];

	scanf("%s", &a);

	

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

		puts("Yes");

	}

	else

	puts("No");

	

	return 0;

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

using namespace std; 



int main() {

     string str;

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



int main(){

	char a[10];

	scanf("%s", &a);

	

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

		puts("Yes");

	}

	else

	puts("No");

	

	return 0;

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

using namespace std;







int main()

{

    

	ios_base::sync_with_stdio(false); cin.tie(NULL);

 



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



int main(){

	char a[10];

	scanf("%s", &a);

	

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

		puts("Yes");

	}

	else

	puts("No");

	

	return 0;

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

#define endl  "\n"

#define ll long long

#define PI acos(-1.0)

#define test cout<<"\n****\n"

#define precise fixed(cout);cout<<setprecision(12)

#define fast  ios_base :: sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)

using  namespace  std;





int main(){



    string str;

    cin>>str;



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

        cout<<"Yes\n";

    }

    else{

        cout<<"No\n";

    }

    return 0;

}

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



int main(){

	char a[10];

	scanf("%s", &a);

	

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

		puts("Yes");

	}

	else

	puts("No");

	

	return 0;

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

#define ll long long

#define endl "\n"

#define mset(arr, val) memset((arr), (val), sizeof(arr))

#define For(i, init, n) for (int64_t (i) = (init); (i) < (n); (i)++)

#define ___ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

using namespace std;



// const double PI = acos(-1.0), E = exp(1.0), EPS = 1e-9;

const int MOD = (int)1e9 + 7, N = (int)1e5;



int main()

{   

#ifdef MY_PREPROCESSOR

    freopen("in.txt", "r", stdin);

    freopen("out.txt", "w", stdout);

#endif

    ___

    

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



int main(){

	char a[10];

	scanf("%s", &a);

	

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

		puts("Yes");

	}

	else

	puts("No");

	

	return 0;

}