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: Accepted)

#include<stdio.h>
#include<stdlib.h>
#include<math.h>


int main(){

  char N[8];

  scanf("%s",N);
  /*
  int A[N];
  int i;
  for(i=0;i<N;i++){
   scanf("%d",A[i]);
   }
  */

//  if (strcmp(N[3],N[4])==0 && strcmp(N[5],N[6])==0){
  if (N[2]==N[3] && N[4]==N[5]){
    printf("Yes");
  }
  else{
    printf("No");
  }







 return(0);
 }