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: Wrong Answer)

#include <stdio.h>
#include <string.h>

int main()
{
    char words[10];
    int i, length;
    
    printf("Enter the Words\n");
    scanf("%s", words);
    length = strlen(words);
    printf("Length of Str is %ld\n", strlen(words)); 
    for(i==0; i<length; i++){
        
    }
    if((words[2] == words[3])&&(words[4] == words[5])){
        printf("yes");
    }else{
        printf("No");
    }
    return 0;
}