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

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

int		main()
{
	int		A, K, N;
	int		*meter;
	int		sum, dis, max, num, i;

	i = 0;
	sum = 0;
	max = 0;
	dis = 0;
	scanf("%d %d\n", &K, &N);
	meter = (int *)malloc(sizeof(int) * (N + 3));
	while (i <= N)
	{
		if (i < N)
			scanf("%d \n", &meter[i]);
		else
			meter[i] = K;
		if (i == 0 && meter[0])
		{
			i++;
			N++;
			meter[i] = meter[0];
			meter[0] = 0;
		}
		if (i)
			dis = meter[i] - meter[i - 1];
		if (dis > max)
		{
			max = dis;
			num = i;
		}
		sum += dis;
		i++;
	}
	sum -= meter[num] - meter[num - 1];
	printf("%d\n", sum);
	return (0);
}