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: Runtime Error)

#include <stdio.h>
main(){
 char get_text;
 scanf("%s" , &get_text);
 char *x = get_text;
 char Emoji[50];
 int i=0;
 while( *x != '\0'){
  if(*x >= 65 || *x <= 122){
   Emoji[i] = *x;						//英文字用配列に格納
   i++;
  }
 }
 if(Emoji[3]==Emoji[4] && Emoji[5]==Emoji[6]){
   printf("yes");
 } else {
   printf("no");
 }
 return 0;
}