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 s[100000];
 
int main(void)
{
	char A[100000];
	char B[100000];
	memset(A, 0, sizeof A);
	memset(B, 0, sizeof B);
	B[0] = 1, B[1] = 2, B[2] = B[3] = 3, B[4] = B[5] = 4;
	cin >> A;
	if (strlen(A) > 6) return puts("No") * 0;
	int t = 0;
	for (int i = 0;i <= 5; ++i)
	{
		if (A[i] > 'z')
			return puts("No") * 0;
		if (!s[A[i]])
			s[A[i]] = ++t,
			A[i] = t;
		else
			A[i] = s[A[i]];
	}
	for (int i = 0;i <= 5; ++i)
	{
		if (A[i] != B[i])
			return puts("No") * 0;
	}
	puts("Yes");
	return 0;
}