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):
import sys
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"+"\n")
else:
  print("No"+"\n")

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()
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):
S = input()
list = []
for i in S:
  list.append(i)
if list[2]==list[3] and list[4]==list[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')
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 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):


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


def read_ints():
    return list(map(int, input().strip().split(' ')))


def solve():
    S = input().strip()
    if S[2] == S[3] and S[4] == S[5]:
        return 'Yes'
    return 'No'


if __name__ == '__main__':
    print(solve())

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

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

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

if len(str1) != 6 :
     print('No')

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

Solution (Python):
word=input().rstrip()
flag=0
if word[2]==word[3]:
    if word[4]==word[5]:
        flag=1
if flag:
    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):
import sys
input = sys.stdin.readline



def main():
    S = input().strip()
    if len(S) != 6:
        return "No"
    if S[2] == S[3] and S[4] == S[5]:
        return "Yes"
    else:
        return "No"


if __name__ == "__main__":
    print(main())

Solution (Python):
s = list(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 = str(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 = str(input())

L = list(S)

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] :
    ans = 'Yes'
else :
    ans = 'No'

print(ans)

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


def main():
    S = input().strip()
    assert len(S) == 6
    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):
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):
a,b,c,d,e,f = input()
if c == d and e == f:
  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, b, c, d, e, f = input()
if c == d and e == f:
    print('Yes')
else:
    print('No')

Solution (Python):
from sys import stdin

s = stdin.readline().rstrip()

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

Solution (Python):
List=list(input())
if List[2]==List[3] and List[4]==List[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):
a = input()
b = (a[2] == a[3] and a[4] == a[5])
c = "Yes" if b else "No"
print(c)

Solution (Python):
s=input().strip()
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):
S = input()

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

Solution (Python):
s = raw_input()
print 'Yes ' if len(s) >= 6 and 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=list(map(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 = list(input())
if s[2] ==s[3] and s[4]==s[5]:
	print('Yes')
else:
	print('No')

Solution (Python):
string=input()

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

Solution (Python):
S = input()
is_flag = True
if S[2] != S[3]:
    is_flag = False
if S[4] != S[5]:
    is_flag = False
if is_flag == True:
    print("Yes")
elif is_flag == False:
    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):
l = input()

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

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

Solution (Python):

"""
Created on Tue Apr 28 21:57:22 2020
"""

import sys


sys.setrecursionlimit(10 ** 9)


mod = 10**9+7

S = input()

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

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]:
    if s[4] == s[5]:
        print("Yes")
        exit(0)

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] 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):
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 = 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):
if __name__ == '__main__':
    s = input()
    if s[2] == s[3] and s[4] == s[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 = 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

S = input()
cond = (S[2]==S[3]) & (S[4]==S[5])

ans = "Yes" if cond else "No"
print(ans)

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

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

Solution (Python):
s = input()
if s[0]==s[1]:
	print("No")
elif s[2] != s[3]:
	print("No")
elif 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):
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=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=lambda:sys.stdin.readline().rstrip();aint=lambda:int(input());ints=lambda:list(map(int,input().split()))
import math;floor,ceil=math.floor,math.ceil
from collections import deque
Yes=lambda b:print('Yes')if b else print('No');YES=lambda b:print('YES')if b else print('NO')
is_even=lambda x:True if x%2==0 else False

def main():
    s = input()
    Yes(s[2]==s[3]and s[4]==s[5])

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

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

Solution (Python):
n = input()

m = list(n)

if m[2] == m[3] and m[4] == m[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 = 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")

main()

Solution (Python):
S =input().strip()

def check(i, j):
    if S[i] == S[j]:
        return True
    return False

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

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


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

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


if __name__ == '__main__':
    main()

Solution (Python):






import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr


def lcm(a, b):
    return a * b // gcd (a, b)





s = inputS()

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 = 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):
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('YNeos'[(s[2]!=s[3])|(s[4]!=s[5])::2])

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

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

Solution (Python):
S = list(input())
a,b=S.pop(),S.pop()
c,d=S.pop(),S.pop()
if a==b and c==d:
  print("Yes")
else:
  print("No")

Solution (Python):
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_tuple(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_col(H):
    '''
    H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) 
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_matrix(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    


MOD = 10**9 + 7
INF = 2**31  

from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  


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

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from heapq import heapify, heappop, heappush
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, 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):
a = input()
if a[3] == a[2] and a[5]==a[4]:
  print('Yes')
else:
  print('No')

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

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

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

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

if __name__ == "__main__":
  resolve()

Solution (Python):
from statistics import median


from fractions import gcd
from itertools import combinations 
from collections import deque
from collections import defaultdict
import bisect










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

def readInts():
  return list(map(int,input().split()))
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[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 = input()
print("Yes" if s[2] == s[3] and s[4] == s[5] else "No")

Solution (Python):
S = input().strip()
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):
sl = list(input())

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


if __name__ == '__main__':
    main()

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

Solution (Python):
S = input()

third = S[2]
fourth = S[3]
fifth = S[4]
sixth = S[5]

print('Yes') if third == fourth and fifth == sixth 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]) & (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]) & (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):
letters = input()
if letters[2] == letters[3] and letters[4] == letters[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):
a,b,c,d,e,f =input()

if c == d and e == f :
  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] and s[4]==s[5]:
    print("Yes")
else:
    print("No")

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

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

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

Solution (Python):
il = input()
if (il[2] == il[3] and il[4] == il[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):
a,b,c,d,e,f = input()
if c == d and e == f :
    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 = str(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 = 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):
s = list(str(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):
"""
import random
import functools
import copy
import bisect
import array
import re
import collections
import heapq
import fractions
import itertools
import string
import math
from operator import itemgetter as ig
from bisect import bisect_left, bisect_right, insort_left, insort_right
from itertools import permutations, combinations, product, accumulate, groupby
from heapq import heappush, heappop
from collections import deque, defaultdict, Counter
import sys
sys.setrecursionlimit(10 ** 7)


inf = 10 ** 20
INF = float("INF")
mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = dd + [(-1, 1), (1, 1), (1, -1), (-1, -1)]
ddn9 = ddn + [(0, 0)]
'''for dx, dy in dd:
        nx = j + dx; ny = i + dy
            if 0 <= nx < w and 0 <= ny < h:'''
"""
from collections import deque, defaultdict, Counter
import math
import sys
sys.setrecursionlimit(10 ** 7)


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



def wip(): return [int(x) - 1 for x in sys.stdin.readline().split()]


def ws(): return sys.stdin.readline().split()


def si(): return int(sys.stdin.readline())  


def ss(): return input()


def hi(n): return [si() for _ in range(n)]


def hs(n): return [ss() for _ in range(n)]  


def s_list(): return list(input())


def mi(n): return [wi() for _ in range(n)]  


def mip(n): return [wip() for _ in range(n)]


def ms(n): return [ws() for _ in range(n)]


def num_grid(n): return [[int(i) for i in sys.stdin.readline().split()[
    0]] for _ in range(n)]  


def grid(n): return [s_list() for _ in range(n)]


def gcd(a, b):
    while b:
        a, b = b, a % b
    return a


def lcm(a, b):
    """a,bの最小公倍数"""
    return a * b // gcd(a, b)


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

import sys
from collections import Counter
from itertools import permutations, combinations
from fractions import gcd
from math import ceil, floor
import bisect
sys.setrecursionlimit(10 ** 6)
inf = float("inf")

def input():
    return sys.stdin.readline()[:-1]

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

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

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 ** 7)
rl = sys.stdin.readline


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 = 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):
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


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


if __name__ == '__main__':
    solve()