Problem:
Score : 100 points

Problem Statement

A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.

Given a string S, determine whether it is coffee-like.

Constraints

S is a string of length 6 consisting of lowercase English letters.

Input

Input is given from Standard Input in the following format:

S

Output

If S is coffee-like, print Yes; otherwise, print No.

Sample Input 1

sippuu

Sample Output 1

Yes

In sippuu, the 3-rd and 4-th characters are equal, and the 5-th and 6-th characters are also equal.

Sample Input 2

iphone

Sample Output 2

No

Sample Input 3

coffee

Sample Output 3

Yes

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#define INF 2000000001
#define ll long long int
 
#include<bits/stdc++.h>
using namespace std;
 
void input(ll a[], ll n)
{
    for(ll i = 1; i <= n; i++)
        cin >> a[i];
}
 
void print(ll a[], ll n)
{
    for(ll i = 1; i <= n; i++)
        cout << a[i] << ' ';
    cout << '\n';
}


bool pal(string s, int i, int j)
{
    string s1 = "";
    string s2 = "";
    for(int k = i; k <= j; k++)
        s1 += s[k];
    for(int k = j; k >= i; k--)
        s2 += s[k];
    return s1 == s2;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    string s;
  	cin >> s;
    if(s[2] == s[3] && s[4] == s[5])
      	cout << "Yes";
 	else
        cout << "No\n";
    
    return 0;
}