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

if (s[2]==s[3]) & (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()

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

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

Solution (Python):
s=input()
print('YNeos'[not(s[2]==s[3] and 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()
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()

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

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

Solution (Python):
import sys
import math
from collections import defaultdict
s=sys.stdin.readline()[:-1]
if len(s)!=6:
    print('No')
else:
    if s[2]==s[3] and s[4]==s[5]:
        print('Yes')
    else:
        print('No')

Solution (Python):

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



if __name__ == "__main__":
    solve()

Solution (Python):
N = input()
flag = 0
if N[2]==N[3]:
    flag += 1
if N[4]==N[5]:
    flag +=1
if flag == 2:
    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):

def a160(s):

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

    return ans

def main():
    s = str(input())
    print(a160(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):
"""def power(x, y): 
    res = 1
    x=x
    while (y > 0): 
        if ((y & 1) == 1) : 
            res = (res * x) 
        y = y >> 1
        x = (x * x)
    return res""" 
"""def fact(n):
    if(n==0):
        return 1
    if(n==1):
        return 1
    return fact(n-1)+fact(n-2)"""

import math





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

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

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

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

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

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

    return len(S) >= 6 and (S[2] == S[3]) and (S[4] == S[5])

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

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


def main():
    s = input()
    res = solve(s)
    print(res)


def test():
    assert solve("sippuu") == "Yes"
    assert solve("iphone") == "No"
    assert solve("coffee") == "Yes"


if __name__ == "__main__":
    test()
    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 = 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]):
    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):
import sys

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

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

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

Solution (Python):
import sys
X=input()
if(X[2]==X[3] and X[4]==X[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()
flg = (s[2] == s[3]) & (s[4] == s[5])
if flg:
  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):

from fractions import gcd
import math

from math import factorial as f

from math import ceil,floor,sqrt


import bisect
import re
import heapq


from copy import deepcopy
import itertools

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

yes = "Yes"
no = "No"

def main():
    s = input()
    if not s[2] == s[3]:
        print(no)
        exit()
    if not s[4] == s[5]:
        print(no)
        exit()
    print(yes)




main()

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

yes = (S[2] == S[3] and S[4] == S[5])

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

Solution (Python):












s = input()

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

Solution (Python):
if __name__ == '__main__':
    
    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):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

def main():
    S = input().strip()

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


if __name__ == "__main__":
    main()

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



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

Solution (Python):


from sys import stdin
import sys
sys.setrecursionlimit(10**8)

def getInputs():
	inputs=[]
	for line in stdin:
		line=line.split()
		inputs.append(line)
	return inputs

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


if __name__=="__main__":
	inputs=getInputs()

	main(inputs)

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

if((get_char[2] == get_char[3]) and ( get_char[4] == get_char[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):
import bisect,collections,copy,itertools,math,string
def I(): return int(input())
def S(): return input()
def LI(): return list(map(int,input().split()))
def LS(): return list(input().split())

S = S()
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):

import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline

from decimal import *

























def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

inf = float('inf')
mod = 1000000007




def main():
	s = input()
	s = s[:-1]

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

	







def int_sqrt2(n):
    def f(prev):
        while True:
            m = (prev + n / prev) / 2
            if m >= prev:
                return prev
            prev = m

    return f(int(math.sqrt(n) * (1 + 1e-10)))



def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res


def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y



def H(n, r, mod=10**9+7):
	
	
    return combination(n+r-1, r, mod)

class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        
        
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

if __name__ == "__main__":
	main()

Solution (Python):
s=list(input())
flag = True
if s[2]!=s[3]:
  flag=False
if s[4]!=s[5]:
  flag=False
if flag:
  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 = input().strip()

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

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

Solution (Python):
S = input().strip()
result = 'No'

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

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().rstrip()

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

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

if not s[4] == s[5]:
    flag = False

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

"""
Created on Sat Mar 28 20:58:44 2020

@author: H_Hoshigi
"""

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 solv(S):
    return (S[2] == S[3]) and (S[4] == S[5])


if __name__ == "__main__":

    S = input()
    ans = solv(S)

    if ans:
        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
sys.setrecursionlimit(10 ** 7)

s = input().strip()

def cond():
    return s[2] == s[3] and s[4] == s[5]

if cond():
    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):
ele =  input().strip()
if ele[2] == ele[3] and ele[4] == ele[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=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
import math
import time

import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq


def dfs(s, prev, pre):
  val[s] += Ope[s] + prev
  for i in G[s]:
    if(i == pre):
      continue
    dfs(i, val[s], s)

def bfs(sx, sy, n):
  que = deque([[sy,sx]])
  while que:
    y,x = que.popleft()
    for i,j in D:
      if(x+i<0 or y+j<0 or x+i>W-1 or y+j>H-1):
        continue
      dist = G[y+j][x+i]
      if(G[y+j][x+i] != "X"):
        if(type(G[y+j][x+i]) is str):
          G[y+j][x+i] = G[y][x]+1
          que.append([y+j,x+i])
        elif(dist>G[y][x]+1):
          G[y+j][x+i] = G[y][x]+1
          que.append([y+j,x+i])
        

def combinations_count(n, r):
  return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))











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

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

Solution (Python):
import collections
import sys
import numpy as np
sys.setrecursionlimit(1000000000)


s = input()

state = 0
if s[2] == s[3]:
    state = 1
else:
    print("No")
    sys.exit()
if s[4] == s[5]:
    state = 1
else:
    state = 0
    print("No")
    sys.exit()
if state == 1:
    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()
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):
n = str(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):
tmp = str(input())
if (tmp[2]==tmp[3]) & (tmp[4]==tmp[5]):
    print("Yes")
else:
    print("No")

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

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

Solution (Python):
import bisect
import math
from collections import deque

def sRaw():
    return input().rstrip("\r")


def iRaw():
    return int(input())


def ssRaw():
    return input().split()


def isRaw():
    return list(map(int, ssRaw()))

INF = 1 << 29



def main():
    S = sRaw()

    ans = "Yes" if S[2]==S[3] and S[4]==S[5] else "No"
    return ans

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

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

Solution (Python):
num = input()

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

Solution (Python):
coffee = input()
if coffee[2] == coffee[3] and coffee[4] == coffee[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(raw_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]:
  if s[4]==s[5]:
    print('Yes')
    sys.exit()
  else:
    print('No')
    sys.exit()
else:
  print('No')
  sys.exit()

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

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

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

Solution (Python):
S = raw_input()

if S[2] == S[3]:
    if S[4] == S[5]:
        print "Yes"
        exit()

print "No"

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

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

solution()

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

Solution (Python):

import sys

YES = "Yes" 
NO = "No"

S = input()

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

Solution (Python):
S = list(input())
hantei = 0
han = 0

if S[2] == S[3]:
    hantei = 1

if S[4] == S[5]:
    han = 1

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

Solution (Python):



import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
read = sys.stdin.read



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

main()

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