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

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

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

Solution (Python):
S = str(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 = str(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=list(raw_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] and len(a)==6:
    print('Yes')
else: 
    print('No')

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

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

Solution (Python):
I = input().split()
S = I[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):
coffee = input()
if (coffee[2] == coffee[3]) & (coffee[4] == coffee[5]):
    print("Yes")
else:
    print("No")

Solution (Python):
string = input("").lower()
print("Yes" if (string[2] == string[3]) and (string[4] == string[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=[]
s=input()
if str.islower(s)==True and s[2]==s[3] and s[4]==s[5]:
    print("Yes")
else:
    print("No")

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

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

if T[2] == T[3] and T[4] == T[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]:
    print("No")
else:
    if 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):
line = input().strip()

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

Solution (Python):
x = list(input())
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 = 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):
usr = input()
arr = [2,4]
bol = True

for i in arr:
    if not (usr[i] == usr[i+1]):
        bol = False

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

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

Solution (Python):
def count_section_by_zero(data):
  count = 0
  flg = False
  start = 0
  for i, d in enumerate(data):
    if flg is False and d != 0:
      count += 1
      flg = True
      
    if d == 0:
      flg = False
  return count

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

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

def lcm_base(x, y):
    return (x * y) // fractions.gcd(x, y)

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)

def gcd(*numbers):
    return reduce(fractions.gcd, numbers)

def gcd_list(numbers):
    return reduce(fractions.gcd, numbers)

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


def divide_two(arg):
  c = 0
  while True:
    if c >= 2:
      break
    if arg % 2 != 0:
      break
    arg //= 2
    c += 1
  return c


def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

def main():
  s = input()
  if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
  else:
    print('No')
  
import math
import fractions
import collections
import itertools
from functools import reduce
main()

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

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

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

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

Solution (Python):
S = input()
if len(S) == 6:
    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):
import sys
input = sys.stdin.readline
from collections import defaultdict, Counter

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

Solution (Python):
s = input()
ret = "No"
if s[2] == s[3] and s[4]==s[5]:
    ret = "Yes"
print("{}".format(ret))

Solution (Python):

s = input()

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

Solution (Python):
word = 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 = 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 numpy as np







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

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


if __name__ == '__main__':
    main()

Solution (Python):
S = input()

v = list(S)

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

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

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

Solution (Python):
s = list(input())
if s[2] == s[3] and s[4] == s[5] and s[0] != s[1] :
    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):
moji=list(input())
if moji[2]== moji[3] and moji[4]== moji[5] :
    print("Yes")
    exit()
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 print('No')

Solution (Python):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

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

Solution (Python):

S = input("")

S1 = str(S[-1])
S2 = str(S[-2])
S3 = str(S[-3])
S4 = str(S[-4])

n = 0

if S1 == S2:
    n += 1
if S3 == S4:
    n += 1

if n == 2:
    print("Yes")
else:
    print("No")

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

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

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

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

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

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

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

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

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

Solution (Python):
N = input()

N = list(N)

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 print('No')

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

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

Solution (Python):
S = input()

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

Solution (Python):
S = input()
for i in range(0, len(S)):
    if ((S[2]==S[3])&(S[4]==S[5])):
        print("Yes")
        break
    else:
        print("No")
        break

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

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

Solution (Python):
s = input()

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

Solution (Python):
S = input()
for i in range(0, len(S)):
    if ((S[2]==S[3])&(S[4]==S[5])):
        print("Yes")
        break
    else:
        print("No")
        break

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

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

Solution (Python):
s=input()

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

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

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

Solution (Python):
import math


def test(data):
    result = False
    if data[2] == data[3]:
        if data[4] == data[5]:
            result = True
    return result
    


data = input()

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

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

Solution (Python):
s = input()

lis = []
for i in s:
  lis.append(i)

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

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

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

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

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

Solution (Python):
S = input()

flg=0
if(S[2]==S[3]):
  flg=flg+1
  if(S[4]==S[5]):
    flg=flg+1

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

Solution (Python):
import numpy as np
S = input()

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

Solution (Python):
neko = input()
nyan = list(neko)

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

Solution (Python):
s=input()
a=set(s[2:4])
b=set(s[4:6])
if len(a)==1 and len(b)==1:
	print('Yes')
else:
	print('No')

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

Solution (Python):
S=input()

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

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

Solution (Python):
S = str(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")
  exit()
print("No")

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

Solution (Python):
S = input()

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

Solution (Python):
s = input()
flag = True
if len(s) != 6:
    flag = False

for i in s:
    if ord(i) < 97 or ord(i) > 122:
        flag = False
if len(s) == 6:
    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()
a = list(a)
if (a[2] == a[3]) & (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):
i = input()
if i[3] == i[2] and i[4] == i[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] and S[4]==S[5]:
    print("Yes")
else : 
    print("No")

Solution (Python):
import sys

for S in sys.stdin:
    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().lower()
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()
s_serve = list(s)

if s.count(s_serve[0])==1 and s.count(s_serve[1])==1 and s_serve[2]==s_serve[3] and s_serve[4]==s_serve[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()
print("Yes" if s[2] == s[3] and s[4] == s[5] else "No")

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

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

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

Solution (Python):
s=input()[2::];print('Yes' if len(set(s[:2]))==1 and len(set(s[2:]))==1 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().strip()
if s[2]==s[3] and s[4]==s[5]:
  print('Yes')
  
else:
  print('No')

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

Solution (Python):
s = input()

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

Solution (Python):
a=input()


b=False
if a[2]==a[3]:
    if a[4]==a[5]:
        b=True


if b==True:
    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()[2::] 
print('Yes' if len(set(s[:2]))==1 and len(set(s[2:]))==1 else 'No')

Solution (Python):
s = input()

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

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

Solution (Python):
S = input()

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

Solution (Python):
s=input()[2::];print('Yes' if len(set(s[:2]))==1 and len(set(s[2:]))==1 else 'No')

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

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

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

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

Solution (Python):
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()[2::];print('Yes' if len(set(s[:2]))==1 and len(set(s[2:]))==1 else 'No')

Solution (Python):
S = input()
if len(set(list(S[2:4]))) == len(set(list(S[4:6]))) == 1:
    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):
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].__eq__(S[3]) and S[4].__eq__(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]):
  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 = str(input())
S = S.lower()
if len(S) == 6:
    if S[2] == S[3] and 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 = 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):
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()
l = []
cont = 0
for i in S:
    l.append(i)

if l[2] == l[3]:
    if l[4] == l[5]:
        cont = 1

if cont == 1:
    print('Yes')
else:
    print('No')

Solution (Python):
i_str = input()
anser = 'No'

if i_str[2:3] == i_str[3:4]:
  if i_str[4:5] == i_str[5:6]:
    anser = 'Yes'
    
print(anser)

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

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

Solution (Python):
S = input()

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

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

Solution (Python):
def main():
    import sys
    S=sys.stdin.readline()
    if S[2]==S[3] and S[4]==S[5]:
        print('Yes')
    else:
        print('No')
        


main()

Solution (Python):



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

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

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

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

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

Solution (Python):
s = input()



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



print(ans)

Solution (Python):

import numpy as np
from functools import *
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline



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


def II():
    return int(input())

directions=np.array([[1,0],[0,1],[-1,0],[0,-1]])
directions = list(map(np.array, directions))

mod = 10**9+7


def nCr(n, r):
    """
    Calculate the number of combination (nCr = nPr/r!).
    The parameters need to meet the condition of n >= r >= 0.
    It returns 1 if r == 0, which means there is one pattern
    to choice 0 items out of the number of n.
    """
    if n<r:
        return 0
    
    r = min(r, n-r)

    
    numerator = 1
    for i in range(n, n-r, -1):
        numerator *= i

    
    denominator = 1
    for i in range(r, 1, -1):
        denominator *= i

    return numerator // denominator

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

Solution (Python):

x = input()
mylist = list(x)

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

Solution (Python):

S= list(input())

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

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

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

Solution (Python):
inputText1 = input()

textList = list(inputText1)


flg = False
if textList[2] == textList[3]:
    if textList[4] == textList[5]:
        flg = True

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

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

Solution (Python):
S = input()

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

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

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

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

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

hoge = list(s)




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

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

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


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


print(Ans)

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

Solution (Python):
n=str(input())
a=list(n)
if n.find(a[2],3,4)!=-1:
   if n.find(a[4],5,)!=-1:
      print('Yes')
   else:print('No')
else:
    print('No')

Solution (Python):
def is_similar_coffee(s):
    if s[2] != s[3]:
        return False
    elif s[4] != s[5]:
        return False
    return True


s = input()
if is_similar_coffee(s):
    print("Yes")
else:
    print("No")

Solution (Python):


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

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