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 Rust (1.15.1) (judge verdict: Accepted)

use std::io::*;

fn main() {
    let mut stdin = stdin();
    let mut buf: [u8; 6] = [0; 6];
    let _ = stdin.read(&mut buf);
    let s: Vec<char> = buf.into_iter().map(|c| *c as char).collect();
    if s.get(2).unwrap() == s.get(3).unwrap() && s.get(4).unwrap() == s.get(5).unwrap() {
        println!("Yes");
    } else {
        println!("No");
    }
}