output_description: If S is coffee-like, print `Yes`; otherwise, print `No`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      S
attempt: import sys
  
  input_methods = ["clipboard", "file", "key"]
  using_method = 0
  input_method = input_methods[using_method]
  
  IN = lambda: map(int, input().split())
  mod = 1000000007
  
  # +++++
  
  
  def main():
      # a = int(input())
      # b , c = IN()
      s = input()
      is_coffee_like = (s[2] == s[3]) and (s[4] == s[5])
      ret = "Yes" if is_coffee_like else "No"
      print(ret)
  
  
  # +++++
  isTest = False
  
  
  def pa(v):
      if isTest:
          print(v)
  
  
  def input_clipboard():
      import clipboard
  
      input_text = clipboard.get()
      input_l = input_text.splitlines()
      for l in input_l:
          yield l
  
  
  if __name__ == "__main__":
      if sys.platform == "ios":
          if input_method == input_methods[0]:
              ic = input_clipboard()
              input = lambda: ic.__next__()
          elif input_method == input_methods[1]:
              sys.stdin = open("inputFile.txt")
          else:
              pass
          isTest = True
      else:
          pass
          # input = sys.stdin.readline
  
      ret = main()
      if ret is not None:
          print(ret)
  
problem_description: 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.
samples: [{"input": "sippuu", "output": "Yes\n    \n\nIn `sippuu`, the 3-rd and 4-th characters are equal, and the 5-th and 6-th\ncharacters are also equal.\n\n* * *"}, {"input": "iphone", "output": "No\n    \n\n* * *"}, {"input": "coffee", "output": "Yes"}]