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::Read;

fn main() {
    let buf = input();
    println!("{}", solve(buf));
}

fn input() -> String {
    let mut buf = String::from("");
    std::io::stdin().read_to_string(&mut buf).unwrap();
    buf
}

fn solve(input: String) -> String {
    let yes = String::from("Yes");
    let no = String::from("No");

    let input = input.chars().collect::<Vec<char>>();

    if input[2] == input[3] && input[4] == input[5] {
        return yes;
    }
    no
}