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):
S = input()
if S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
a = input()
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 = 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[-2] == S[-1]:
    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())

        ans = "No"

        if S[2]==S[3]:
                if S[4]==S[5]:
                        ans = "Yes"

        print("{}".format(ans))

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):



                            
                            
                            
                            



import sys
import math


def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))

def printwsp(*args): return print(*args, end="")
def printsp(*args): return print(*args, end=" ")
def printchk(*args): return print(*args, end="tst, ")

MODPRIME = int(1e9+7); BABYMOD = 998244353;



ans = 'No'
s = input()
if len(s)==6 and s[0] != s[1] and s[2] == s[3] and s[4] == s[5]:
    ans = "Yes"
print(ans)



'''
THE LOGIC AND APPROACH IS BY ME @luctivud.
SOME PARTS OF THE CODE HAS BEEN TAKEN FROM WEBSITES LIKE::
(I Own the code if no link is provided here or I may have missed mentioning it)
: DO NOT PLAGIARISE.
'''

Solution (Python):
S = input()
res = "No"

if S[2] == S[3] and S[4] == S[5]:
    res = "Yes"

print(res)

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):
n=list(input())

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

Solution (Python):
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    s = list(input()[:-1])
    if s[2] == s[3] and s[4] == s[5]:
        print('Yes')
    else:
        print('No')


if __name__ == "__main__":
    setrecursionlimit(10000)
    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] 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):
coffee = input()

if len(coffee) != 6:
    print("文字数が異なります")

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

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

Solution (Python):
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

s=input()

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

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

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 = str(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()
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 print("No")

Solution (Python):
S = [i for i in 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())
t=0
if S[2]==S[3]:
    if S[4]==S[5]:
        print("Yes")
        t=1


if t==0:
    print("No")

Solution (Python):

import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

S = sr()
bl = False
if S[2] == S[3] and S[4] == S[5]:
    bl = True

print('Yes' if bl else 'No')

Solution (Python):


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

s = input()
f(s)

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

Solution (Python):
a = input()

b=a[0]
c=a[1]
d=a[2]
e=a[3]
f=a[4]
g=a[5]

if d == e and f==g:
	print('Yes')
else:
	print('No')

Solution (Python):
def main():
    k = input()
    print("Yes" if k[2] == k[3] and k[4] == k[5] else "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):
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()
print('YNeos'[s[2]!=s[3] or s[4]!=s[5]::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):
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()
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()

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

Solution (Python):
s = input()

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

Solution (Python):
arr=list(input())
if len(arr)<6:print("No")
else:
    if arr[2]==arr[3] and arr[4]==arr[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 = 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 = 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):
n = input()

if n[2] == n[3]  and n[4] == n[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()
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):
import sys
sys.setrecursionlimit(10**7)
input = lambda: sys.stdin.readline().strip()

def main():
    S = input()
    print("Yes" if S[2]==S[3] and S[4]==S[5] else "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()
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):
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().rstrip()
r = 'Yes' if S[2] == S[3] and S[4] == S[5] else 'No'
print(r)

Solution (Python):
n=input()
if(n[2]==n[3] and n[4]==n[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')
    exit()
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")

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):
N = input()
flag = False
if N[2]==N[3] and N[4]==N[5]:
    flag = True

if flag==True:
    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 = input()

b = list(a)

if len(a) >= 6:
	if b[2] == b[3]:
		if b[4] == b[5]:
			print("Yes")
		else:
			print("No")
	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()
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):
from sys import stdin

S = list(stdin.readline().rstrip())
print('Yes' if S[2]==S[3] and S[4]==S[5] else 'No')

Solution (Python):


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

Solution (Python):

S = [0] + list(input())
print('Yes' if S[3]==S[4] and S[5]==S[6] else 'No')

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

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

if word[2]==word[3] and word[4]==word[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())
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):

from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
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)]

sys.setrecursionlimit(1000000)
mod = 1000000007

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


if __name__ == "__main__":
    solve()

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

Solution (Python):
n=input()
if n[2]==n[3] and n[4]==n[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 = str(input())

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

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

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

if __name__ == '__main__':

    ABC_160_A()

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()
if S[2]==S[3] and S[4]==S[5]:
  print('Yes')
else:
  print('No')

Solution (Python):







def main():
    s = input()
    print('Yes' if s[2] == s[3] and s[4] == s[5] else '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):
import sys
line = input()

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

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[3]==a[2]and a[5]==a[4]:
    print('Yes')
else:
    print('No')

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

Solution (Python):
n=input()
if n[2]==n[3] and n[4]==n[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()
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()

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 = str(input())

j = 0

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 = str(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=input()
if a[2]==a[3] and a[4]==a[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):
val = input()

if val[2:3] == val[3:4] and val[4:5] == val[5:6]:
    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):
from sys import stdin


def main():
    s = stdin.readline()[:-1]
    print('Yes') if s[2] == s[3] and s[4] == s[5] 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):
def solve():
    S = input()
    if S[2] == S[3] and S[4] == S[5]:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    solve()

Solution (Python):
S =list(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 = list(input())
if s[2] == s[3]:
  if s[4] == s[5]:
    print("Yes")
  else:
    print("No")
    exit
else:
  print("No")
  exit

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 = input()
if S[2]==S[3] and S[4]==S[5]:
  print("Yes")
else:
  print("No")

Solution (Python):

"""
Created on Wed May  6 16:23:09 2020

@author: shinba
"""

N = input()

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

Solution (Python):
chars = [c for c in input()]
print('Yes' if chars[2] == chars[3] and chars[4] == chars[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()
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):
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 = list(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):
s = input()
print("Yes" if s[2]==s[3] and s[4]==s[5] else "No")

Solution (Python):
c=str(input())
print('Yes' if c[2]==c[3] and c[4]==c[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()
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):
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):
sentence = input()

if sentence[2] == sentence[3] and sentence[4] == sentence[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):
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] == 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():
    s = sys.stdin.readline().strip()  
    solve(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):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    s = S()
    if s[2] == s[3] and s[4] == s[5]:
        return 'Yes'

    return "No"


print(main())

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

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
import sys
def I(): return int(input())  
def Is(): return map(int, input().split())  
def LI(): return list(map(int, input().split()))  
def TI(): return tuple(map(int, input().split()))  
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()  
def LS(): return list(input())  
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(1000000)
MOD = 1000000007
INF = float('inf')

s = 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
sys.setrecursionlimit(10 ** 6)

int1 = lambda x: int(x) - 1
def II(): return int(input())

def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())

def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

INF = float('inf')

def solve():
    s = list(input())

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


if __name__ == '__main__':
    solve()

Solution (Python):
s = input()

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

Solution (Python):
a=list()
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 = list(str(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 = [ _ for _ in input()]
print("Yes" if s[2] == s[3] and s[4] == s[5] else "No")

Solution (Python):
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
s = readline()

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")
    sys.exit()
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

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():
    s = sys.stdin.readline().strip()  
    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=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()
f="No"
if s[2]==s[3] and s[4]==s[5]:
    f="Yes"
if len(s)!=6:
    f="No"
print(f)

Solution (Python):
n = input()

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

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

Solution (Python):
s=input()
a=0
if s[2]==s[3]:
    a=a+1
if s[4]==s[5]:
    a=a+1
if a==2:
    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(str(input()))
if  s[2]==s[3] and s[4]==s[5] :
    print('Yes') 
else :
    print('No')

Solution (Python):
s = list(input())
han=False
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=str(input())
x=list(s)
if x[2]==x[3] and x[4]==x[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(str(input()))
if S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()
if len(S)==6 :
    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=str(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=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()
count = 0
if S[2] == S[3]:
    count+=1
if S[4] == S[5]:
    count+=1
if count == 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):
l=list(input())
if l[2]==l[3] and l[4]==l[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):
import sys
sys.setrecursionlimit(10**6) 
import math
from copy import copy, deepcopy
from operator import itemgetter

from bisect import bisect_left, bisect, bisect_right

from collections import deque 



from collections import Counter

from itertools import accumulate

from heapq import heapify,heappop,heappush


def input(): return sys.stdin.readline()[:-1]
def printl(li): print(*li, sep="\n")
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds










S=input()

if S[3]==S[2] and S[5]==S[4]:
    print('Yes')
    exit()
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 = list(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):
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 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=input()
if s[2]==s[3] and s[4]==s[5]:
    print("Yes")
else:
    print("No")

Solution (Python):

import copy
import random
import bisect 
import fractions 
import math
import sys
import collections

mod = 10**9+7
sys.setrecursionlimit(mod) 

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

S = str(input())

if S[2] == S[3] and S[4] == S[5]:
    ans = "Yes"
else:
    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()

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