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: Wrong Answer)

#include<bits/stdc++.h>
using namespace std;
int main()
{
         int i,c=0;
         string s;
         cin>>s;
         if(s[0]==s[1] || s[0]==s[2] || s[0]==s[3] || s[0]==s[4] || s[0]==s[5])c=1;
         if(s[1]==s[2] ||s[1]==s[3]||s[1]==s[4]||s[1]==s[5])c=1;
         if(s[2]!=s[3]||s[2]==s[4]||s[2]==s[5])c=1;
         if(s[3]==s[4]||s[3]==s[5])c=1;
         if(s[4]!=s[5])c=1;
         if(c==0)cout<<"Yes"<<endl;
         else cout<<"No"<<endl;
         return 0;
}