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 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include<string.h>
#define N 6
int main()
{ 
    char s[N],l;
    
   scanf("%s", &s);
   l=strlen(s);
  if(l==6){
      for(int i=0;i<l;i++){
          if(s[i]>='a' && s[i]<='z'){
            if(s[l-1]==s[l-2] && s[l-3]== s[l-4]){
                printf("yes");
                break;
           }else{
              printf("no");
              break;
                }  
          }
      }
      
      
      
  }
  

    return 0;
}