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 PHP (5.6.30) (judge verdict: Time Limit Exceeded)

<?php
$n = 300;
$wf = new Wf($n);
 
for($i = 0; $i < $n*$n; $i++){
    $wf->connect(rand(1,100),rand(1,100),rand(1,100)); 
}
$wf->solve();
 
/**
 * Warshall–Floyd
 * Attention: 1-origin
 **/
class Wf{
  public $d;
  public $n;
  function __construct($n)	{
    $this->n = $n;
    $array = array_fill(1, $n, 10**18);
    $this->d = array_fill(1, $n, $array);
    for($i = 1; $i <= $this->n; $i++){
        $this->d[$i][$i] = 0;
    }
  }
  function connect($a, $b = false, $c = 1){
    if(is_array($a))list($a, $b, $c) = $a;
    $this->d[$a][$b] = $c;
  }
  function connect2($a, $b = false, $c = 1){
    if(is_array($a))list($a, $b, $c) = $a;
    $this->d[$a][$b] = $c;
    $this->d[$b][$a] = $c;
  }
  function solve(){
    $d = $this->d;
    $n = $this->n;
    for($k = 1; $k <= $n; ++$k){
      $dk = $d[$k];
      for($i = 1; $i <= $n; ++$i){
        $di = &$d[$i];
        for($j = 1; $j <= $n; ++$j){
          if($di[$j] > $di[$k] + $dk[$j]){
            $di[$j] = $di[$k] + $dk[$j];
          }
        }
      }
    }
    return $this->d = $d;
  }
}