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 K, N;
 
  cin >> K >> N;
  // 100要素の配列で初期化
  vector<int> A(N);

  // 100個の入力を受け取る
  for (int i = 0; i < N; i++) {
    cin >> A.at(i);
  }

   vector<int> B(N);
  
   for (int j = 0; j < N-1 ; j++) {
   B.at(j) = A.at(j+1) - A.at(j);
  }
  
  B.at(N-1) = K - A.at(N-1);
  
  int max;
  
  for (int k = 0; k < N-1; k++) {
  if (B.at(k) >= B.at(k+1)){
    max = B.at(k);
  }
  else{
    max = B.at(k+1);
  }
  
    cout << K - max << endl;
    
}
}