Problem Statement
A string of length 66 consisting of lowercase English letters is said to be coffee-like if and only if its 33-rd and 44-th characters are equal and its 55-th and 66-th characters are also equal.
Given a string SS, determine whether it is coffee-like.
Constraints
-
SS is a string of length 66 consisting of lowercase English letters.
Input
Input is given from Standard Input in the following format:
SS
Output
If SS is coffee-like, print Yes; otherwise, print No.