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 (Python):
coffee = "coffee"
input_str = input()

if input_str[2] == input_str[3] and input_str[4] == input_str[5]:
    print('Yes')
else:
    print('No')

Solution (Python):

S = input()
if S[2] == S[3]:
    if S[4] == S[5]:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Solution (Python):
S = input()
if S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()

if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
if s[2]==s[3] and s[4]==s[5]:
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()

if s[2] == s[3] and s[4] == s[5]:
  print('Yes')
else:
  print('No')

Solution (Python):
import sys








import math



readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    s = input()

    if s[2] == s[3]:
        if s[4] == s[5]:
            print('Yes')
            sys.exit()

    print('No')

if __name__ == '__main__':
    main()

Solution (Python):
S = input()
S = str(S)
s1, s2, s3, s4, s5, s6 = S[0],S[1],S[2],S[3],S[4],S[5]

if (s3==s4)&(s5==s6):
  print('Yes')
else:
  print('No')

Solution (Python):
s=input()
ans="No"
if s[2]==s[3] and s[4]==s[5]:
  ans="Yes"
print(ans)

Solution (Python):
s = input()
if s[2] == s[3] and s[4] == s[5]:
  print("Yes")
else:
  print("No")

Solution (Python):
a = input()

if a[2]==a[3] and a[4]==a[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
s=input()
if s[2]==s[3] and s[4]==s[5]:
    print("Yes")
else:
    print("No")

Solution (Python):

a = input()

if(a[2]==a[3] and a[4]==a[5]):
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
if s[2] == s[3]:
    if s[4] == s[5]:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Solution (Python):
S = input()
if S[2] == S[3] and S[4] == S[5]:
  print('Yes')
else:
  print('No')

Solution (Python):
S  = input()

if S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()

if (S[2] == S[3] and S[4] == S[5]):
    print('Yes')
else:
    print('No')

Solution (Python):
S = list(input())

if S[2] == S[3] and S[4] == S[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()

if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()

if (s[2] == s[3]) and (s[4] == s[5]):
  print("Yes")
else:
  print("No")

Solution (Python):
s=input()
if s[2]==s[3] and s[4]==s[5]:
  print("Yes")
else:
  print("No")

Solution (Python):
s = list(input())
k = 0
if s[2]==s[3]:
    k += 1
if s[4]==s[5]:
    k += 1
if k == 2:
    print("Yes")
else:
    print("No")

Solution (Python):
s=input()
if s[2]==s[3] and s[4]==s[5]:
  print("Yes")
else:
  print("No")

Solution (Python):
S = input()

if S[2]==S[3] and S[4] == S[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()

s_list = list(s)

if s_list[2] == s_list[3] and s_list[4] == s_list[5]:
  print("Yes")
else:
  print("No")

Solution (Python):



S = input()

ans = "Yes"

if S[2] != S[3]:
  ans = "No"

if S[4] != S[5]:
  ans = "No"

print(ans)

Solution (Python):
s = input()
if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
S=input()
print("Yes" if S[2]==S[3] and S[4]==S[5] else "No")

Solution (Python):
a = input()
if a[2] == a[3]:
    if a[4] == a[5]:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Solution (Python):
s = input()
if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()


if len(S) >= 6 and (S[2] == S[3]) and (S[4] == S[5]):
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()

if S[2]==S[3] and S[4]==S[5]:
	print('Yes')
else:
	print('No')

Solution (Python):
s = input()
if s[2] == s[3] and s[4] == s[5]:
	print('Yes')
else:
	print('No')

Solution (Python):
S =  input()
print("Yes" if S[2] == S[3] and S[4] == S[5] else "No")

Solution (Python):
S = input()

if S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
data = input()

if data[2] == data[3] and data[4] == data[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
S=input()
if S[2]==S[3] and S[4]==S[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
S = list(input())

S3 = S[2]
S4 = S[3]

S5 = S[4]
S6 = S[5]

if S3 == S4 and S5 == S6:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()

if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
def main():
    s = input()

    ans = 'Yes' if s[2] == s[3] and s[4] == s[5] else 'No'
    print(ans)

if __name__ == "__main__":
    main()

Solution (Python):
def main():
  
  s = list(input())
  
  
  
  
  
  
  ans = 0
  count = 0
  lis = []
  
  if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
  else:
    print("No")
  

if __name__ == '__main__':
  main()

Solution (Python):
S = input()

if(S[2] == S[3] and S[4] == S[5]):
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()

if S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else:
    print('No')

Solution (Python):

s = input()
print("Yes") if s[2]==s[3] and s[4]==s[5] else print("No")

Solution (Python):
s = input()

if s[2]==s[3] and s[4]==s[5]:
  print("Yes")
  
else:
  print('No')

Solution (Python):
S=list(input())

if S[2]==S[3] and S[4]==S[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()

if S[2] == S[3] and S[4] == S[5]:
  print('Yes')
else:
  print('No')

Solution (Python):
S = input()

if (S[2]==S[3] and S[4]==S[5]):
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()

if(S[2] == S[3] and S[4] == S[5]):
  print("Yes")
else:
    print("No")

Solution (Python):

s = input()
if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = list(input())
c = 0
if s[2] == s[3] and s[4] == s[5]:
  print('Yes')
else:
  print('No')

Solution (Python):
from collections import defaultdict, deque
import sys
import heapq
import bisect
import math
import itertools
import string
import queue
import copy
import time
from fractions import gcd

sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7

def inp(): return int(sys.stdin.readline())
 
def inp_list(): return list(map(int, sys.stdin.readline().split()))

def lcm(x, y): return (x * y) // gcd(x, y)


from collections import defaultdict, deque
import sys
import heapq
import bisect
import math
import itertools
import string
import queue
import copy
import time
from fractions import gcd

sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7

def inp(): return int(sys.stdin.readline())
 
def inp_list(): return list(map(int, sys.stdin.readline().split()))

def lcm(x, y): return (x * y) // gcd(x, y)

S = input()
if S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else:
    print('No')

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(S: str):
    if S[2] == S[3] and S[4] == S[5]:
        print(YES)
    else:
        print(NO)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    solve(S)

if __name__ == '__main__':
    main()

Solution (Python):
S = input()
if (S[2] == S[3]) and (S[4]==S[5]):
	print("Yes")
else: print("No")

Solution (Python):
S = list(input())
if S[2]==S[3] and S[4]==S[5]:
    print("Yes")
else: 
    print("No")

Solution (Python):
a = list(input().rstrip())
print('Yes') if (a[2] == a[3] and a[4] == a[5]) else print('No')

Solution (Python):


s = input()
print("Yes" if s[2]==s[3] and s[4]==s[5] else "No")

Solution (Python):
S = list(input())

if S[2] == S[3] and S[4] == S[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
ans = 'No'
if s[2] == s[3] and s[4] == s[5]:
    ans = 'Yes'
print(ans)

Solution (Python):
s = str(input())
if s[3] == s[2] and s[5] == s[4]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()

if s[2] == s[3] and s[4] == s[5]:
  print('Yes')
else:
  print('No')

Solution (Python):
s = str(input())
print("Yes") if s[2] == s[3] and s[4] == s[5] else print("No")

Solution (Python):
s=input()
print('Yes' if s[2]==s[3] and s[4]==s[5] else 'No')

Solution (Python):
s = input()

if s[2] == s[3] and s[4] == s[5]:
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()
if s[2]==s[3] and (s[4]==s[5]):
  print("Yes")
else:
  print("No")

Solution (Python):
S = input()

if len(S) < 6:
    print("No")
elif S[2] == S[3] and S[4] == S[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
p = str(input())
if p[2] == p[3] and p[4] == p[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()
if S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()

if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
inp = input()
if inp[2] == inp[3] and inp[4] == inp[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = str(input())

if s[2]==s[3] and s[4]==s[5] :
    print("Yes")
else:
    print("No")

Solution (Python):

import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1

def read_int():
    return int(input())


def read_int_n():
    return list(map(int, input().split()))


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(S):
    if S[2] != S[3]:
        return 'No'

    if S[4] != S[5]:
        return 'No'
    return 'Yes'


def main():
    S = read_str()
    print(slv(S))


if __name__ == '__main__':
    main()

Solution (Python):
s = list(input())
if (s[2] == s[3]) and (s[4] == s[5]):
  print("Yes")
else:
  print("No")

Solution (Python):
S = input()
if S[2] == S[3] and S[4] == S[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()
if S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()

if S[2]==S[3] and S[4]==S[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()

if s[2]==s[3] and s[4]==s[5]:
  print('Yes')
else:
  print('No')

Solution (Python):
S = input()

if S[3] == S[2] and S[4] == S[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
S=input()
if S[3]==S[2] and S[4]==S[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
S = str(input())
S = list(S)

hantei = list('coffee')
if S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
a,b,c,d,e,f=input();print('YNeos'[c!=d or e!=f::2])

Solution (Python):
s = input()
if s[2]==s[3] and s[4]==s[5]:
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()
if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
def inpl():
    return list(map(int, input().split()))


S = input()
print("Yes" if S[2] == S[3] and S[4] == S[5] else "No")

Solution (Python):
a = input()

if a[2] == a[3] and a[4] == a[5]:
  print("Yes")
else:
  print("No")

Solution (Python):
S = input()

if S[2] == S[3] and S[4] == S[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()

if S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()
if S[2]==S[3] and S[4]==S[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
def main():
  S = str(input())

  s_line = list(S)

  if s_line[2] == s_line[3] and s_line[4] == s_line[5]:
    print('Yes')
  else:
    print('No')  

if __name__ == "__main__":
  main()

Solution (Python):
s = list(input())

if s[2] == s[3] and s[4] == s[5]:
  print('Yes')
else:
  print('No')

Solution (Python):
import sys
import numpy as np

from collections import deque 
from functools import reduce



s = input()

if (s[2] == s[3]) and (s[4] == s[5]):
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
if (s[2]==s[3]) & (s[4]==s[5]):
    print('Yes')
else:
    print('No')

Solution (Python):
s=list(input())
if s[3] == s[2] and s[4] == s[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
if s[2] == s[3]:
  if s[4] == s[5]:
    print('Yes')
    exit()
print('No')

Solution (Python):
a = list(input())
ans = "Yes"

if a[2] != a[3]:
  ans = "No"

if a[4] != a[5]:
  ans = "No"
  
print(ans)

Solution (Python):
s=list(input())

if s[2] == s[3]:
    if s[4] == s[5]:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Solution (Python):
s = input()

if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys,math
sys.setrecursionlimit(10**9)
from collections import defaultdict
 
IA = lambda: map(int,input().split())
IAS= lambda: map(str,input().split())


s=input()

if len(s)==6 and s[3]==s[2] and s[5]==s[4]:
    print("Yes")
else:
    print("No")

Solution (Python):
list_a = list(input())

if list_a[2] == list_a[3]:
  if list_a[4] == list_a[5]:
    print('Yes')
  else:
    print('No')
    
else:
  print('No')

Solution (Python):
S = list(input())

if S[2]==S[3] and S[4]==S[5]:
    print("Yes")
else:
    print("No")

Solution (Python):


import sys


def LI():
    return list(map(int, sys.stdin.buffer.readline().split()))


def I():
    return int(sys.stdin.buffer.readline())


def LS():
    return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()


def S():
    return sys.stdin.buffer.readline().rstrip().decode('utf-8')


def IR(n):
    return [I() for i in range(n)]


def LIR(n):
    return [LI() for i in range(n)]


def SR(n):
    return [S() for i in range(n)]


def LSR(n):
    return [LS() for i in range(n)]


def SRL(n):
    return [list(S()) for i in range(n)]


def MSRL(n):
    return [[int(j) for j in list(S())] for i in range(n)]




def main():
    s = S()

    if s[2] == s[3] and s[4] == s[5]:
        print("Yes")

    else:
        print("No")


main()

Solution (Python):
s = input()
if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
def isCoffee(s):
    return s[2] == s[3] and s[4] == s[5]

s = input()
res = 'Yes' if isCoffee(s) else 'No'
print(res)

Solution (Python):
import sys
import math
import bisect

def main():
    s = input()
    if len(s) == 6 and s[2] == s[3] and s[4] == s[5]:
        print('Yes')
    else:
        print('No')

if __name__ == "__main__":
    main()

Solution (Python):
s = input()
if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
print('Yes' if s[2] == s[3] and s[4] == s[5] else 'No')

Solution (Python):


iim = lambda: map(int, input().rstrip().split())

def resolve():
    s = input()

    print("Yes" if s[2] == s[3] and s[4] == s[5] else "No")

if __name__ == "__main__":
    resolve()

Solution (Python):
s = input()

if s[2] == s[3] and s[4] == s[5] :
    print('Yes')
else :
    print('No')

Solution (Python):
l = list(input())

if (l[2]==l[3]) & (l[4]==l[5]):
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()		

ans = "No"
if s[2]==s[3] and s[4]==s[5]:
	ans = "Yes"
print(ans)

Solution (Python):












mod = int(1e9+7)
INF = 1<<29
lINF = 1<<35

def main():
    s = input()
    if s[2]==s[3] and s[4]==s[5]:
        print("Yes")
    else:
        print("No")
    return

if __name__=='__main__':
    main()

Solution (Python):
S=input()
if S[2] == S[3] and S[4] == S[5]:
    print('Yes')

else:
    print('No')

Solution (Python):
s = input()
if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()

if s[2] != s[3]:
    print('No')
    exit()
elif s[4] != s[5]:
    print('No')
    exit()
else:
    print('Yes')

Solution (Python):
def resolve():
    S_list = list(input())

    if S_list[2] == S_list[3] and S_list[4] == S_list[5]:
        print('Yes')
    else:
        print('No')

if __name__ == "__main__":
    resolve()

Solution (Python):
def main():
    S = input()

    if S[2] == S[3] and S[4] == S[5]:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

Solution (Python):
import sys
S = input()

if (S[2] == S[3]) and (S[4] == S[5]):
    print("Yes")
else:
    print("No")

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline

    S = input().rstrip('\n')

    if S[2] == S[3] and S[4] == S[5]:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Solution (Python):

S = input()

result = "No"
if S[2] == S[3] and S[4] == S[5]:
    result = "Yes"
print(result)

Solution (Python):
S = input()
N = len(S)
if N != 6:
  print("No")
else:
  if S[2] == S[3] and S[4] == S[5]:
    print("Yes")
  else:
    print("No")

Solution (Python):
S = list(input())
if S[2] == S[3] and S[4] == S[5]:
  print("Yes")
else:
  print("No")

Solution (Python):

s = input()

if s[2]==s[3] and s[4]==s[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()

if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
if s[2]==s[3] and s[4]==s[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
if s[2]==s[3] and s[4]==s[5]:
  print("Yes")
else:
  print("No")

Solution (Python):
S = input()

if S[2] == S[3] and S[4] == S[5]:
  print("Yes")
else:
  print("No")

Solution (Python):
S = input()

if S[2] == S[3] and S[4] == S[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input();

if s[2] == s[3] and s[4] == s[5] :
    print('Yes');
else :
    print('No');

Solution (Python):
S = input()
def calculate(s):
    if s[2] == s[3]:
        if s[4] == s[5]:
            print("Yes")
            return

    print("No")
calculate(S)

Solution (Python):
s = str(input())

if s[2] != s[3] or s[4] != s[5]:
    print("No")
else:
    print("Yes")

Solution (Python):
S = input()

if S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
from sys import stdin




U = stdin.readline().rstrip().split()

if U[0][2]==U[0][3] and U[0][4]==U[0][5]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = list(input())
if (s[2] == s[3]) and (s[4] == s[5]):
    print("Yes")
else:
    print("No")

Solution (Python):
from sys import stdin


def get_result(data):
    S = data[0]
    if S[2] == S[3] and S[4] == S[5]:
       return 'Yes'
    return 'No'


if __name__ == '__main__':
    data = list(map(str, stdin.readline().rstrip('\n').split(' ')))
    result = get_result(data)
    print(result)

Solution (Python):
s = input()
if (s[2]==s[3])&(s[4]==s[5]):
    print('Yes')
else:
    print('No')

Solution (Python):
s = list(input())


if (s[2] == s[3] and s[4] == s[5]):
    print("Yes")
else:
    print("No")

Solution (Python):
S=str(input())

if S[2]==S[3] and S[4]==S[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
S = list(input())

if S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
if s[2] == s[3] and s[4] == s[5]:
  print("Yes")
else:print("No")

Solution (Python):
S=input()

if(S[3]==S[2] and S[4]==S[5]):
    print("Yes")
else:
    print("No")

Solution (Python):
s = list(input())
if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
a = input()
A = list(a)
if A[2]==A[3] and A[4]==A[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()

if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()
if S[2]==S[3] and S[4]==S[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()
if S[2]==S[3] and S[4]==S[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
print(("Yes" if s[2] == s[3] and s[4] == s[5] else "No"))

Solution (Python):
s = input()

if s[2] == s[3] and s[4] == s[5]:
  print('Yes')
else:
  print('No')

Solution (Python):



def main():
    s = input()
    if s[2] == s[3] and s[4] == s[5]:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Solution (Python):
S = input()

if S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else :
    print('No')

Solution (Python):
s = [each for each in input()]
if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()
if (S[2]==S[3])&(S[4]==S[5]):
  print("Yes")
else:
  print("No")

Solution (Python):

S = input()

if(S[2] == S[3] and S[4] == S[5]):
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()

if s[2] == s[3] and s[4] == s[5]:
  print('Yes')
else:
  print('No')

Solution (Python):
S = list(input())

if S[2] == S[3] and S[4] == S[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
if s[2] == s[3]:
    if s[4] == s[5]:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Solution (Python):
def main():
  s = list(input())
  if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
  else:
    print('No')
main()

Solution (Python):
import sys 
import math
s=input()
if s[2:3]==s[3:4] and s[4:5]==s[5:6]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = list(input())

ret = (s[2] == s[3]) and (s[4] == s[5])
if ret:
    print('Yes')
else:
    print('No')

Solution (Python):
a = input()

if a[2]== a[3] and a[4]== a[5]:
  print('Yes')
else:
  print('No')

Solution (Python):
A = input()
if A[2]==A[3] and A[4]==A[5]:
  print("Yes")
else:
  print("No")

Solution (Python):
S = input().strip() ;
if S[2] == S[3] and S[4] == S[5] :
	print ( "Yes" ) ; 
else :
	print ( "No" ) ;

Solution (Python):
str = input()
if str[2] == str[3] and str[4] == str[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
if s[2:3] == s[3:4] and s[4:5] == s[5:6]:
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()

ans = S[2] == S[3] and S[4] == S[5]

if ans:
    print("Yes")
else:
    print("No")

Solution (Python):
def a():
    S = list(input())
    if (S[2] == S[3] and S[4] == S[5]):
        print('Yes')
    else:
        print('No')
    return



if __name__ == "__main__":
    a()

Solution (Python):
S = list(input())
print('Yes' if S[2] == S[3] and S[4]== S[5] else 'No')

Solution (Python):
s = input()
if(s[2]==s[3] and s[4]==s[5]):
    print("Yes")
else:
    print("No")

Solution (Python):
s=input()
if s[2]==s[3]and s[4]==s[5]:
    print('Yes')
else:
    print('No')

Solution (Python):


S = input()

if S[2]==S[3] and S[4]==S[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
s=input()
if s[2]==s[3] and s[4]==s[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
a=list(input())
if a[2] == a[3] and a[4] == a[5]:
  print('Yes')
else:
  print('No')

Solution (Python):
S = input()
if S[2] == S[3] and S[4] == S[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
a = input()
l = list(a)
if l[2] == l[3] and l[4] == l[5]:
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()
if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
s=input()

if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()
print('Yes' if S[2] == S[3] and S[4] == S[5] else 'No')

Solution (Python):
s = list(input())

if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()

if S[2] == S[3] and S[4] == S[5]:
  print("Yes")
else:
  print("No")

Solution (Python):
S=input()
if S[2]==S[3] and S[4]==S[5]:
  print('Yes')
else:
  print('No')

Solution (Python):
import sys

s = sys.stdin.readline().strip()
print("Yes" if s[2] == s[3] and s[4] == s[5] else "No")

Solution (Python):
S = str(input())

if S[2] == S[3] and S[4] == S[5] :
  print("Yes")
else :
  print("No")

Solution (Python):
s = list(input())
if s[2] == s[3] and s[4] == s[5]:
  print("Yes")
else:
  print("No")

Solution (Python):
S=input()
if S[2]==S[3]:
    if S[4]==S[5]:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Solution (Python):
s = str(input())

res = True

if s[2] != s[3]:
    res = False

if s[4] != s[5]:
    res = False

if res:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()

if s[2] == s[3] and s[4] == s[5]:
  print('Yes')
else:
  print('No')

Solution (Python):
def main():
    S = list(input())
    if S[2] == S[3] and S[4] == S[5]:
        print('Yes')
    else:
        print('No')

main()

Solution (Python):
S = input()
if (S[2] == S[3]) and (S[4] == S[5]):
    print('Yes')
else:
    print('No')

Solution (Python):
S=input()
if S[2]== S[3] and S[4]==S[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
i = input()
if i[2] == i[3] and  i[4] == i[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = raw_input()
print 'Yes' if s[2]==s[3] and s[4]==s[5] else 'No'

Solution (Python):
s=input('')
if s[2]==s[3] and s[4]==s[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
s=list(input())
if (s[2]==s[3]) and (s[4]==s[5]):
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()

if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
else:
    print("No")

Solution (Python):





s = input()


if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
else:
    print("No")

Solution (Python):


s = input()

if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
else:
    print("No")

Solution (Python):

import sys
input = sys.stdin.readline




'''
A=[]
B=[]
for i in range():
    a, b = map(int, input().split())
    A.append(a)
    B.append(b)'''



s=input().strip("\n")
if s[2]==s[3] and s[4]==s[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = str(input())

ans = 'No'

if s[2]==s[3] and s[4]==s[5]:
    ans = 'Yes'

print(ans)

Solution (Python):
s=input()
s=list(s)
if s[2]==s[3] and s[4]==s[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()

if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
s=input()
if s[2]==s[3] and s[4]==s[5]:
  print('Yes')
else:
  print('No')

Solution (Python):
import sys

S=input()

if (S[2]==S[3] and S[4]==S[5]):
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()

print(
    "Yes" if S[2] == S[3] and S[4] == S[5] else "No"
)

Solution (Python):
a=input()
if a[2]==a[3] and a[4]==a[5]:
  print("Yes")
else:
  print("No")

Solution (Python):
S = input()
if S[2] == S[3] and S[4] == S[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
S=input()

if S[2]==S[3]:
    if S[4]==S[5]:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Solution (Python):
S = input()

if S[2] == S[3] and S[4] == S[5]:
  print("Yes")
else:
  print("No")

Solution (Python):
import sys, re
import math
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7



s = input()

if s[2] == s[3] and s[4] == s[5] :
    print("Yes")
else:
    print("No")

Solution (Python):
S=str(input())
if S[2]==S[3] and S[4]==S[5]:
	print('Yes')
else:
	print('No')

Solution (Python):
a = input()
if a[2] == a[3] and a[4] == a[5]:
  print("Yes")
else:
  print("No")

Solution (Python):
S = input()
if S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
def main():
    s = input()
    if s[2] == s[3] and s[4] == s[5]:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Solution (Python):

S = input()

if S[2] == S[3] and S[4] == S[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
S=str(input())
if S[2]==S[3] and S[4]==S[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys

a=input()

if a[2]==a[3]:
    if a[4]==a[5]:
        print("Yes")
        sys.exit()

print("No")

Solution (Python):
s = input()

ans = 'Yes' if (s[2]==s[3])and(s[4]==s[5]) else 'No'
print(ans)

Solution (Python):
s=input()
if s[2]==s[3] and s[4]==s[5]:
	print('Yes')
else: print('No')

Solution (Python):
s= input()
if s[2]==s[3]and s[4]==s[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
a = list(input())
print('Yes') if a[2]==a[3] and a[4]==a[5] else print('No')

Solution (Python):
S = input()

if S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
S = list(input())
if S[3] == S[2]:
    if S[4] == S[5]:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Solution (Python):
S = input()
if S[2] == S[3] and S[4] == S[5]:
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()
print("Yes" if s[2] == s[3] and s[4] == s[5] else "No")

Solution (Python):
S=input()
print('Yes' if S[2]==S[3] and S[4]==S[5] else 'No')

Solution (Python):
test = str(input())
if test[2] == test[3] and test[4] == test[5]:
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()
if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
s=input()
ans = 'Yes' if s[2]==s[3] and s[4]==s[5] else 'No'
print(ans)

Solution (Python):
S = [i for i in input()]

if S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
if s[2:3] == s[3:4] and s[4:5] == s[5:6]:
	print("Yes")
else:
	print("No")

Solution (Python):

S = input()


if S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else:
    print('No')