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>

int main()
{
    int k,n;
    scanf("%d %d", &k,&n);
    int p[n];
    for(int i=1;i<=n;i++)
    {
        scanf("%d", &p[i]);
    }
     int max = p[1];

  for (int i = 1; i <=n; i++)
  {
    if (p[i] > max)
    {
       max  = p[i];
    }
  }
  int min2;
  int min =min2= 10000;
   
    for (int i = 1; i <=n; i++)
    {
        if(p[i] < min)
        {
           min= p[i];
        }
        else if (p[i] < min2 && p[i] != min) 
            min2 = p[i];
    }
    if(min==0){
        if(max-min2<k-max+min2){
            printf("%d", max-min2);
        }
        else
        printf("%d", k-max+min2);
    }
    else 
        if((max-min)<=(min+k-max))
            printf("%d", max-min);
        else
            printf("%d", k-max+min);
    return 0;
}