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>
int main(void){
  int round, house, i, j, range, length;
  scanf("%d %d", &round, &house);
  int dist[house];
  for(i = 0; i < house; i++){
    scanf("%d", &dist[i]);
  }
  
  range = dist[1] - dist[0];
  
  for(i = 1; i < house - 1; i++){
    if(range < (dist[i+1] - dist[i])){
      range = dist[i+1] - dist[i];
    }
  }
 
  
  if(dist[0] == 0){
    if(range < (round - dist[house-1])){
      range = round - dist[house-1];
    }
  }
  
  if(dist[0] =! 0){
    if(range < (dist[house-1] - dist[0])){
      range = dist[house-1] - dist[0];
    }
  }
  
  length = round - range;
  printf("%d\n",length);
  
  return 0;
}