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




import sys
input = sys.stdin.readline



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

    res = 'Yes'

    if S[2] != S[3]:
        res = 'No'

    if S[4] != S[5]:
        res = 'No'

    print(res)



main()

Solution (Python):

S = input()


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

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

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

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

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

Solution (Python):
input_str = input()

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

Solution (Python):
s = input()

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

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

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

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

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

Solution (Python):

import sys
import itertools
import fractions
import copy
import bisect


from operator import itemgetter
from sys import stdin

from operator import mul
from functools import reduce
from collections import Counter


N=3
M=3
i=0
j=0
k=0
n=3
r=1
a=[0]*5
b=[]
s=input()
a=[i for i in s]

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







"1行1つの整数を入力を取得し、整数と取得する"




"12 21 332 とか入力する時に使う"
"1行に複数の整数の入力を取得し、整数として扱う"

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''

for i in number_list:
    print(number_list[i-1])

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''

'''
x=[]
y=[]
for i in range(N):
    x1, y1=[int(i) for i in input().split()]
    x.append(x1)
    y.append(y1)
print(x)
print(y)
"複数行に2数値を入力する形式 x座標とy座標を入力するイメージ"
'''

'''
mixlist=[]
for i in range(N):
    a,b=input().split()
    mixlist.append((int(a),b))
print(mixlist)
"複数行にintとstrを複合して入力するやつ，今回はリスト一つで処理している"
'''

'''



"正方行列にstr型の値を入力"
'''




'''
入力
1 2
4 5
7 8
出力結果
[[1, 2], [4, 5], [7, 8]]
'''
"列数に関して自由度の高いint型の値を入力するタイプの行列"


'''
table = [[int(i) for i in input().split()] for m in range(m)]

print(type(N))
print(N)
print(type(M))
print(M)

print(type(table))
print(table)
'''











'''
入力
1234
出力
1
[[1, 2, 3, 4]]
'''




'''
word_list= input().split(" ")
print(word_list[0])
"連続文字列の入力"
"qw er ty とかの入力に使う"
"入力すると空白で区切ったところでlistの番号が与えられる"
'''



'''
A, B, C=stdin.readline().rstrip().split()
print(A)
"リストではなく独立したstr型を入れるなら以下のやり方でOK"
'''




"aという変数に入っているものを大文字にして出力"

















'''
def cmb(n,r):
    
    r= min(n-r,r)
    
    if r == 0: return 1
    over = reduce(mul, range(n, n-r, -1))
    
    
    

    under = reduce(mul, range(1, r+1))
    
    
    
    

    return over // under
    
    
    
    
a = cmb(n, r)

'''

'''




for i in a.most_common(n):print(i)





 


'''









'''
bisect.bisect_left(a, x, lo=0, h=len(a))
引数
a: ソート済みリスト
x: 挿入したい値
lo: 探索範囲の下限
hi: 探索範囲の上限
(lo, hiはスライスと同様の指定方法)
bisect_leftはソートされたリストaに対して順序を保ったままxを挿入できる箇所を探索します。leftが示す通り、aにすでにxが存在している場合は、挿入箇所は既存のxよりも左側になります。また、lo, hiを指定することで探索範囲を絞り込むことも可能です。デフォルトはaの全体が探索対象です。
'''

Solution (Python):
S = input()

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

Solution (Python):

S = input()
S_list = list(S)

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

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

if S[2] == S[3] and S[4] == S[5]:
    rev = 'Yes'

print(rev)

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

"""
Created on Sat Mar 28 20:59:34 2020

@author: liang
"""

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

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

s = input()

coffee(s)

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

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

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

Solution (Python):
a=input()
i=[]
for k in a:
  i.append(k)
if i[2]==i[3] and i[4]==i[5]:
  print("Yes",end="")
else:
  print("No",end="")

Solution (Python):
def resolve():
    '''
    code here
    '''
    S = input()
    
    is_1st = False
    if S[2] == S[3]:
        is_1st = True

    is_2nd = False
    if S[4] == S[5]:
        is_2nd = True

    is_ans = False
    if is_1st and is_2nd:
        is_ans = True
    
    print('Yes') if is_ans else print('No')
    
if __name__ == "__main__":
    resolve()

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

Solution (Python):
"""
Author    : co_devil Chirag Garg
Institute : JIIT
"""
from math import factorial
from math import log, ceil
from collections import defaultdict
from math import *
from sys import stdin, stdout
import itertools
import os
import sys
import threading
from collections import deque, Counter, OrderedDict, defaultdict
from heapq import *



from fractions import Fraction
mod = int(pow(10, 9)+7)


def ii(): return int(input())


def si(): return str(input())


def mi(): return map(int, input().split())


def li(): return list(mi())


def fii(): return int(stdin.readline())


def fsi(): return str(stdin.readline())


def fmi(): return map(int, stdin.readline().split())


def fli(): return list(fmi())


abd = {'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12,
       'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24,
       'z': 25}


def getKey(item): return item[0]


def sort2(l): return sorted(l, key=getKey)


def d2(n, m, num): return [[num for x in range(m)] for y in range(n)]


def isPowerOfTwo(x): return (x and (not (x & (x - 1))))


def decimalToBinary(n): return bin(n).replace("0b", "")


def ntl(n): return [int(i) for i in str(n)]


def powerMod(x, y, p):
    res = 1
    x %= p
    while y > 0:
        if y & 1:
            res = (res * x) % p
        y = y >> 1
        x = (x * x) % p
    return res


graph = defaultdict(list)
visited = [0] * 1000000
col = [-1] * 1000000


def bfs(d, v):
    q = []
    q.append(v)
    visited[v] = 1
    while len(q) != 0:
        x = q[0]
        q.pop(0)
        for i in d[x]:
            if visited[i] != 1:
                visited[i] = 1
                q.append(i)
        print(x)


def make_graph(e):
    d = {}
    for i in range(e):
        x, y = mi()
        if x not in d:
            d[x] = [y]
        else:
            d[x].append(y)
        if y not in d:
            d[y] = [x]
        else:
            d[y].append(x)
    return d


def gr2(n):
    d = defaultdict(list)
    for i in range(n):
        x, y = mi()
        d[x].append(y)
    return d


def connected_components(graph):
    seen = set()

    def dfs(v):
        vs = set([v])
        component = []
        while vs:
            v = vs.pop()
            seen.add(v)
            vs |= set(graph[v]) - seen
            component.append(v)
        return component

    ans = []
    for v in graph:
        if v not in seen:
            d = dfs(v)
            ans.append(d)
    return ans


def primeFactors(n):
    s = set()
    while n % 2 == 0:
        s.add(2)
        n = n // 2
    for i in range(3, int(sqrt(n)) + 1, 2):
        while n % i == 0:
            s.add(i)
            n = n // i
    if n > 2:
        s.add(n)
    return s


def find_all(a_str, sub):
    start = 0
    while True:
        start = a_str.find(sub, start)
        if start == -1:
            return
        yield start
        start += len(sub)


def SieveOfEratosthenes(n, isPrime):
    isPrime[0] = isPrime[1] = False
    for i in range(2, n):
        isPrime[i] = True
    p = 2
    while (p * p <= n):
        if (isPrime[p] == True):
            i = p * p
            while (i <= n):
                isPrime[i] = False
                i += p
        p += 1
    return isPrime


def dijkstra(edges, f, t):
    g = defaultdict(list)
    for l, r, c in edges:
        g[l].append((c, r))

    q, seen, mins = [(0, f, ())], set(), {f: 0}
    while q:
        (cost, v1, path) = heappop(q)
        if v1 not in seen:
            seen.add(v1)
            path = (v1, path)
            if v1 == t:
                return (cost, path)

            for c, v2 in g.get(v1, ()):
                if v2 in seen:
                    continue
                prev = mins.get(v2, None)
                next = cost + c
                if prev is None or next < prev:
                    mins[v2] = next
                    heappush(q, (next, v2, path))
    return float("inf")


def binsearch(a, l, r, x):
    while l <= r:
        mid = l + (r-1)//2
        if a[mid]:
            return mid
        elif a[mid] > x:
            l = mid-1
        else:
            r = mid+1
    return -1














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

Solution (Python):
I=lambda:list(map(int,input().split()))
s=list(input())
if s[2]==s[3] 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()
if s[0]!=s[1] and 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]:
    if a[4]==a[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):


import sys


def IOE():
    sys.stdin = open("input.txt", "r")
    sys.stdout = open("output.txt", "w")


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):
judge = False

S = input()

if S[2] == S[3] and S[4] == S[5]:
    judge = True

if judge == True:
    print('Yes')
else:
    print('No')

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

Solution (Python):
s = input()

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

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

flag1=0
flag2=0
if s[2]==s[3]:
  flag1=1
if s[4]==s[5]:
  flag2=1
  
if flag1*flag2==1:
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()

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

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



if __name__ == "__main__":
    resolve()

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

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

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

Solution (Python):
a=input()
if len(a)==6 and 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 = 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):

import sys
sys.setrecursionlimit(15000)
s = input()

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

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

Solution (Python):
S = input()

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

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

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

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

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

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

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

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


if __name__ == '__main__':
    main()

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

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

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

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

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

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

Solution (Python):
S = input()



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

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

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

Solution (Python):

import sys
list_str = list(input())

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

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

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


def b():
    print()


def c():
    print()


def d():
    print()


def e():
    print()


a()

Solution (Python):
S = input()

hoge = list(S)

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

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

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

Solution (Python):
S = input()

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

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

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

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

Solution (Python):



def main():
  s = input().strip()
  coffee = 'coffee'
  if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
  else:
    print('No')
    
if __name__=='__main__':
  main()

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


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



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

if __name__ == '__main__':
    main()

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

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 len(s) != 6:
    print("string error")
elif s[2] == s[3] and s[4] == s[5]:
    print("Yes")
else:
    print("No")

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

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

Solution (Python):
s = input()

three = s[2]
four = s[4]

if three == s[3] and four == s[5]:
  print("Yes")
  exit()
  
print("No")

Solution (Python):
S = input()

if len(S) != 6:
    print("No")

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

Solution (Python):



from sys import stdin


def main():
    S = stdin.readline()

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


if __name__ == "__main__":
    main()

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

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

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


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



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

if __name__ == '__main__':
    main()

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

Solution (Python):

s = input()
result = True

if s[2] != s[3]:
    result = False
if s[4] != s[5]:
    result = False

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

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

print(main())

Solution (Python):
n = list(input())
ans = "No"
if n[2] == n[3]:
    if n[4] == n[5]:
        ans = "Yes"

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

Solution (Python):
import sys

x = sys.stdin.readline()

flag = "Yes"
if(x[2] != x[3]):
  flag = "No"
if(x[4] != x[5]):
  flag = "No"
  
print(flag)

sys.stdout.flush()

Solution (Python):
S = input()

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

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

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

Solution (Python):

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

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

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

else:
  print("No")

Solution (Python):


import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        
        
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    s = lines[0]

    return (s, )


def solve(s):
    
    result = 'No' 
    if s[2] == s[3] and s[4] == s[5]:
        result = 'Yes'
    
    return result
    


def main():
    
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

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

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

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

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

Solution (Python):
check_word = input()
if (check_word[2] == check_word[3]) & (check_word[4] == check_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):
word = input()


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

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    s=SI()
    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')