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 (Clang 3.8.0) (judge verdict: Runtime Error)

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
 
 
int i = 0;
 
 
int main() {
    
    char S[6];
    scanf("%s", S);
 
    for (i = 0; i <= 5; i++) {
        if (S[2] == S[3] && S[4] == S[5]) {
            printf("yes\n");
        }
        else {
            printf("no\n");
        }
    }
}