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)

#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define OUT(s) cout << s << "\n";
#define S_LEN(s) s.length();
#define L_LEN(l) sizeof(l) / sizeof(l[0]);
using namespace std;
string S;


void Main(){
    if (S.substr(2, 1) == S.substr(3, 1) && S.substr(4, 1) == S.substr(5, 1)) {
        OUT("Yes");
    } else {
        OUT("No");
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    cin >> S;

    Main();
    return 0;
}