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++14 (GCC 5.4.1) (judge verdict: Runtime Error)

#include<bits/stdc++.h>
#include<ctype.h>
using namespace std;
int main()
{
  char a[6];
  for(int i =1;i<=6;i++)
    cin>>a[i];
    for(int i =1;i<=6;i++)
    {if(islower(a[i]))
        continue;
     else
       exit(1);
    }
      
 if((a[3]==a[4])&&(a[5]==a[6]))
   cout<<"YES";
  else
    cout<<"NO";
}