stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

string s;

int main() {

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.343981848206509x):
#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.h>

using namespace std;

string s;

int main()

{

    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.329983092029056x):
#include <algorithm>

#include <cstdio>

#include <cstring>

using namespace std;



char s[100];



int main() {

    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.size() < 6)

    {

        cout << "No\n";

    }

    else

    {

        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.312622854045987x):
#include <algorithm>

#include <cstdio>

#include <cstring>

using namespace std;



char s[100];



int main() {

    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;

#define ll long long

const int maxn = 1e6 + 10; 

const double pi = acos(-1.0);



inline ll read()

{

    ll kk=0,f=1;

    char cc=getchar();

    while(cc<'0'||cc>'9'){if(cc=='-')f=-1;cc=getchar();}

    while(cc>='0'&&cc<='9'){kk=(kk<<1)+(kk<<3)+cc-'0';cc=getchar();}

    return kk*f;

}



char s[10];

int main(void)

{

	scanf("%s",s);

	if(s[2]==s[3]&&s[4]==s[5])printf("Yes");

	else printf("No");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.266136227458742x):
#include <algorithm>

#include <cstdio>

#include <cstring>

using namespace std;



char s[100];



int main() {

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

#include<cstring>

using namespace std;



char ss[10];

int main(){

        scanf("%s", ss);

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

            printf("Yes\n");

       else

           printf("No\n");

       return 0;



 }


// Faster C++ solution for the same problem (measured speedup: 5.266136227458742x):
#include <algorithm>

#include <cstdio>

#include <cstring>

using namespace std;



char s[100];



int main() {

    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;

#define mod 1000000007

#define N 100005

#define ll long long

#define ull unsigned long long

#define loop1(i, j, k, step) for (int i = j; i < k; i += step)

#define loop(i, j, k) for (int i = j; i < k; i++)

#define rloop1(i, j, k, step) for (int i = j; i >= k; i -= step)

#define rloop(i, j, k) for (int i = j; i >= k; i--)

#define rep(i, k) for (int i = (0); i < (k); i++)

#define rrep(i, k) for (int i = k - 1; i >= 0; i--)



#define forall(it, l) for (auto it = l.begin(); it != l.end(); it++)

#define mp make_pair

#define pb push_back

#define pop pop_back

#define F first

#define S second

#define sz(x) (int)(x).size()

#define endl "\n"

#define Max (int)INT_MAX

#define Min (int)INT_MIN

#define MEM(a, b) memset(a, (b), sizeof(a))

#define fast_io ios_base::sync_with_stdio(0), cin.tie(NULL)

#define lin puts("");

typedef vector<int> vi;

typedef pair<int, int> pi;

typedef vector<ll> vl;

typedef pair<ll, ll> pll;

//char ch[101][101];

char c;

int arr[10000], brr[105];



void solve()

{

    string s;

    cin >> s;

    if (s.size() < 6 || s.size() > 6)

    {

        cout << "No" << endl;

        return;

    }

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

    {

        cout << "Yes" << endl;

    }

    else

    {

        cout << "No" << endl;

    }

}

int main()

{

    auto start = clock();

    fast_io;

    //freopen("test.txt", "r", stdin);

    int t;

    t = 1;

    // cin >> t;

    while (t--)

    {

        solve();

    }

    auto stop = clock();

    cerr << "time taken:" << double(stop - start) / double(CLOCKS_PER_SEC) << " s" << endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.5444855352018685x):
#include <algorithm>

#include <cstdio>

#include <cstring>

using namespace std;



char s[100];



int main() {

    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 mp make_pair

#define ff first

#define ss second

#define pb push_back

#define w(x) scanf("%d",&x);while(x--)

#define rep(i,a,b) for(i=a;i<=b;i++)

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

#define pi 2*acos(0.0)

using namespace std;

typedef long long ll;

typedef pair<ll,ll> pll;

typedef vector<int> vi;



long long int mod=1e9+9;

const int N=100000;

int t,i,j,cs=0,n,a,b;

string s;



int main()

{

    cin>>s;

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

        cout<<"Yes";

    else

        cout<<"No";

    cout<<endl;

}






// Faster C++ solution for the same problem (measured speedup: 5.334713229507906x):
#include <algorithm>

#include <cstdio>

#include <cstring>

using namespace std;



char s[100];



int main() {

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

	std::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;

}

// Faster C++ solution for the same problem (measured speedup: 5.4490222309455305x):
#include <algorithm>

#include <cstdio>

#include <cstring>

using namespace std;



char s[100];



int main() {

    scanf("%s",s);

    if(s[2]==s[3]&&s[4]==s[5])  printf("Yes");

    else printf("No");

    return 0;

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

#include <iostream>

#include <cstdio>

#include <cstdlib>

using namespace std;

int main(){

    //freopen("data.in","r",stdin);

    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.325388446199234x):
#include <algorithm>

#include <cstdio>

#include <cstring>

using namespace std;



char s[100];



int main() {

    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.h>

using namespace std;

string s;

int main()

{

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



int main (){

	

	char s[15];

	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.size() < 6)

    {

        cout << "No\n";

    }

    else

    {

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



int main (){

	

	char s[15];

	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;

#define ll long long

const int maxn = 1e6 + 10; 

const double pi = acos(-1.0);



inline ll read()

{

    ll kk=0,f=1;

    char cc=getchar();

    while(cc<'0'||cc>'9'){if(cc=='-')f=-1;cc=getchar();}

    while(cc>='0'&&cc<='9'){kk=(kk<<1)+(kk<<3)+cc-'0';cc=getchar();}

    return kk*f;

}



char s[10];

int main(void)

{

	scanf("%s",s);

	if(s[2]==s[3]&&s[4]==s[5])printf("Yes");

	else printf("No");

	return 0;

}

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



int main (){

	

	char s[15];

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

#include<cstring>

using namespace std;



char ss[10];

int main(){

        scanf("%s", ss);

       if(ss[2]==ss[3]&&ss[4]==ss[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 s[15];

	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;

#define mod 1000000007

#define N 100005

#define ll long long

#define ull unsigned long long

#define loop1(i, j, k, step) for (int i = j; i < k; i += step)

#define loop(i, j, k) for (int i = j; i < k; i++)

#define rloop1(i, j, k, step) for (int i = j; i >= k; i -= step)

#define rloop(i, j, k) for (int i = j; i >= k; i--)

#define rep(i, k) for (int i = (0); i < (k); i++)

#define rrep(i, k) for (int i = k - 1; i >= 0; i--)



#define forall(it, l) for (auto it = l.begin(); it != l.end(); it++)

#define mp make_pair

#define pb push_back

#define pop pop_back

#define F first

#define S second

#define sz(x) (int)(x).size()

#define endl "\n"

#define Max (int)INT_MAX

#define Min (int)INT_MIN

#define MEM(a, b) memset(a, (b), sizeof(a))

#define fast_io ios_base::sync_with_stdio(0), cin.tie(NULL)

#define lin puts("");

typedef vector<int> vi;

typedef pair<int, int> pi;

typedef vector<ll> vl;

typedef pair<ll, ll> pll;

//char ch[101][101];

char c;

int arr[10000], brr[105];



void solve()

{

    string s;

    cin >> s;

    if (s.size() < 6 || s.size() > 6)

    {

        cout << "No" << endl;

        return;

    }

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

    {

        cout << "Yes" << endl;

    }

    else

    {

        cout << "No" << endl;

    }

}

int main()

{

    auto start = clock();

    fast_io;

    //freopen("test.txt", "r", stdin);

    int t;

    t = 1;

    // cin >> t;

    while (t--)

    {

        solve();

    }

    auto stop = clock();

    cerr << "time taken:" << double(stop - start) / double(CLOCKS_PER_SEC) << " s" << endl;

    return 0;

}

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



int main (){

	

	char s[15];

	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 mp make_pair

#define ff first

#define ss second

#define pb push_back

#define w(x) scanf("%d",&x);while(x--)

#define rep(i,a,b) for(i=a;i<=b;i++)

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

#define pi 2*acos(0.0)

using namespace std;

typedef long long ll;

typedef pair<ll,ll> pll;

typedef vector<int> vi;



long long int mod=1e9+9;

const int N=100000;

int t,i,j,cs=0,n,a,b;

string s;



int main()

{

    cin>>s;

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

        cout<<"Yes";

    else

        cout<<"No";

    cout<<endl;

}






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



int main (){

	

	char s[15];

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

	std::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;

}

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



int main (){

	

	char s[15];

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

#include <iostream>

#include <cstdio>

#include <cstdlib>

using namespace std;

int main(){

    //freopen("data.in","r",stdin);

    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 s[15];

	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;

    char a,b,c,d;

    a=s[2];

    b=s[3];

    c=s[4];

    d=s[5];

    if(a==b && c==d)

    {

        cout<<"Yes"<<endl;

    }

    else

    {

        cout<<"No"<<endl;

    }

}


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



int main (){

	

	char s[15];

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

	printf("Yes\n");

	else

	printf("No\n");

}

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



int main (){

	

	char s[15];

	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.h>

using namespace std;

string s;

int main()

{

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



int main(){

	char C[7];

		scanf("%s",C);

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

    			puts("Yes");

			}

    		else{

    			puts("No");

			}



	

 return 0;	

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



using namespace std;



int main()

{

    string s; cin >> s;

    if(s.size() < 6)

    {

        cout << "No\n";

    }

    else

    {

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



int main(){

	char C[7];

		scanf("%s",C);

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

    			puts("Yes");

			}

    		else{

    			puts("No");

			}



	

 return 0;	

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

using namespace std;

#define ll long long

const int maxn = 1e6 + 10; 

const double pi = acos(-1.0);



inline ll read()

{

    ll kk=0,f=1;

    char cc=getchar();

    while(cc<'0'||cc>'9'){if(cc=='-')f=-1;cc=getchar();}

    while(cc>='0'&&cc<='9'){kk=(kk<<1)+(kk<<3)+cc-'0';cc=getchar();}

    return kk*f;

}



char s[10];

int main(void)

{

	scanf("%s",s);

	if(s[2]==s[3]&&s[4]==s[5])printf("Yes");

	else printf("No");

	return 0;

}

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



int main(){

	char C[7];

		scanf("%s",C);

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

    			puts("Yes");

			}

    		else{

    			puts("No");

			}



	

 return 0;	

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

#include<cstdio>

#include<cstdlib>

#include<cstring>

using namespace std;



char ss[10];

int main(){

        scanf("%s", ss);

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

		scanf("%s",C);

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

    			puts("Yes");

			}

    		else{

    			puts("No");

			}



	

 return 0;	

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

using namespace std;

#define mod 1000000007

#define N 100005

#define ll long long

#define ull unsigned long long

#define loop1(i, j, k, step) for (int i = j; i < k; i += step)

#define loop(i, j, k) for (int i = j; i < k; i++)

#define rloop1(i, j, k, step) for (int i = j; i >= k; i -= step)

#define rloop(i, j, k) for (int i = j; i >= k; i--)

#define rep(i, k) for (int i = (0); i < (k); i++)

#define rrep(i, k) for (int i = k - 1; i >= 0; i--)



#define forall(it, l) for (auto it = l.begin(); it != l.end(); it++)

#define mp make_pair

#define pb push_back

#define pop pop_back

#define F first

#define S second

#define sz(x) (int)(x).size()

#define endl "\n"

#define Max (int)INT_MAX

#define Min (int)INT_MIN

#define MEM(a, b) memset(a, (b), sizeof(a))

#define fast_io ios_base::sync_with_stdio(0), cin.tie(NULL)

#define lin puts("");

typedef vector<int> vi;

typedef pair<int, int> pi;

typedef vector<ll> vl;

typedef pair<ll, ll> pll;

//char ch[101][101];

char c;

int arr[10000], brr[105];



void solve()

{

    string s;

    cin >> s;

    if (s.size() < 6 || s.size() > 6)

    {

        cout << "No" << endl;

        return;

    }

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

    {

        cout << "Yes" << endl;

    }

    else

    {

        cout << "No" << endl;

    }

}

int main()

{

    auto start = clock();

    fast_io;

    //freopen("test.txt", "r", stdin);

    int t;

    t = 1;

    // cin >> t;

    while (t--)

    {

        solve();

    }

    auto stop = clock();

    cerr << "time taken:" << double(stop - start) / double(CLOCKS_PER_SEC) << " s" << endl;

    return 0;

}

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



int main(){

	char C[7];

		scanf("%s",C);

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

    			puts("Yes");

			}

    		else{

    			puts("No");

			}



	

 return 0;	

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

#define mp make_pair

#define ff first

#define ss second

#define pb push_back

#define w(x) scanf("%d",&x);while(x--)

#define rep(i,a,b) for(i=a;i<=b;i++)

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

#define pi 2*acos(0.0)

using namespace std;

typedef long long ll;

typedef pair<ll,ll> pll;

typedef vector<int> vi;



long long int mod=1e9+9;

const int N=100000;

int t,i,j,cs=0,n,a,b;

string s;



int main()

{

    cin>>s;

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

        cout<<"Yes";

    else

        cout<<"No";

    cout<<endl;

}






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



int main(){

	char C[7];

		scanf("%s",C);

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

    			puts("Yes");

			}

    		else{

    			puts("No");

			}



	

 return 0;	

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

using namespace std;

int main(){

	std::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;

}

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



int main(){

	char C[7];

		scanf("%s",C);

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

    			puts("Yes");

			}

    		else{

    			puts("No");

			}



	

 return 0;	

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

#include <iostream>

#include <cstdio>

#include <cstdlib>

using namespace std;

int main(){

    //freopen("data.in","r",stdin);

    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 C[7];

		scanf("%s",C);

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

    			puts("Yes");

			}

    		else{

    			puts("No");

			}



	

 return 0;	

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

using namespace std;

int main()

{

    string s;

    cin>>s;

    char a,b,c,d;

    a=s[2];

    b=s[3];

    c=s[4];

    d=s[5];

    if(a==b && c==d)

    {

        cout<<"Yes"<<endl;

    }

    else

    {

        cout<<"No"<<endl;

    }

}


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



int main(){

	char C[7];

		scanf("%s",C);

    		if(C[2]==C[3]&&C[4]==C[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]))

	printf("Yes\n");

	else

	printf("No\n");

}

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



int main(){

	char C[7];

		scanf("%s",C);

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

    			puts("Yes");

			}

    		else{

    			puts("No");

			}



	

 return 0;	

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



typedef long long ll;



using namespace std;



int main()

{

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



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

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



    string s;

    cin >> s;

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

    {

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

        {

            cout << "Yes" << endl;

            break;



        }



        else

        {

            cout << "No" << endl;

            break;

        }

    }

}


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



int main(){

	char C[7];

		scanf("%s",C);

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

    			puts("Yes");

			}

    		else{

    			puts("No");

			}



	

 return 0;	

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

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



#define nl "\n"

#define fr first

#define sc second

#define MP make_pair

#define pb push_back

#define VI vector<int>

#define VII vector<ll>

#define MAP map <int,int>

#define PI pair < int , int >

#define sz(v) (int)(v).size()

#define all(v) v.begin(),v.end()

#define mem(a,val) memset(a,val,sizeof(a))

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



const int N = (int)4e7;

const int MOD = (int)1e9 + 7;

const double pi = 2 * acos(0.0);

const double eps = 1e-9;



typedef long long ll;

typedef double db;



using namespace std;



int main()

{

    io;

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

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



    ///Let the showdown begin





    string s;

    cin >> s;



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

        cout << "Yes" << nl;

    else

        cout << "No" << nl;



    ///Happily DONE



    return 0;

}


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



int main(){

	char C[7];

		scanf("%s",C);

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

}