Problem:
 Score : 100 points    Problem Statement A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3 -rd and 4 -th characters are equal and its 5 -th and 6 -th characters are also equal. Given a string S , determine whether it is coffee-like.      Constraints  S is a string of length 6 consisting of lowercase English letters.         Input Input is given from Standard Input in the following format:  S       Output If S is coffee-like, print Yes ; otherwise, print No .        Sample Input 1 sippuu      Sample Output 1 Yes  In sippuu , the 3 -rd and 4 -th characters are equal, and the 5 -th and 6 -th characters are also equal.       Sample Input 2 iphone      Sample Output 2 No       Sample Input 3 coffee      Sample Output 3 Yes

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

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

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

Solution (Python):











































global FLAG_LOG
FLAG_LOG = False


def log(value):
    
    
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    S = lines[0]
    
    
    
    
    
    
    
    
    
    

    result = 'Yes'
    if S[2] != S[3]:
        result = 'No'
    elif S[4] != S[5]:
        result = 'No'

    return [result]



def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines



def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['sippuu']
        lines_export = ['Yes']
    if pattern == 2:
        lines_input = ['iphone']
        lines_export = ['No']
    if pattern == 3:
        lines_input = ['coffee']
        lines_export = ['Yes']
    return lines_input, lines_export



def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode



def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    
    
    
    
    
    
    
    
    
    
    



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


from typing import *
import collections
import functools
import itertools
import math
import sys

INF = float('inf')
YES = "Yes"  
NO = "No"  


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


def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    print(f'{solve(S)}')


if __name__ == '__main__':
    main()

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

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 math
import sys
readline = sys.stdin.readline


def main():
    s = readline().rstrip()
    print('YNeos'[not(s[2] == s[3] and s[4] == s[5])::2])


if __name__ == '__main__':
    main()

Solution (Python):
s=str(input())
print("NYoe s"[s[2]==s[3] and s[4]==s[5]::2])

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] ) & ( S[4] == S[5] ):
    print("Yes")
else:
    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 = input()
if not ( len(S) == 6 and S.islower() ): sys.exit()
print('Yes') if S[2] == S[3] and S[4] == S[5] else print('No')

Solution (Python):
S=input()

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

Solution (Python):

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

Solution (Python):
a,b,c,d,e,f = input()
if c == d and e == f:
  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 S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else:
    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()
if S[2]==S[3] and S[4]==S[5]:
    print("Yes")
else:
    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[3]==s[2] and s[4]==s[5] else 'No')

Solution (Python):
N = input()
if N[-4] == N[-3] and N[-2] == N[-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):
word = list(str(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();print('NYoe s'[s[2]==s[3]and s[4]==s[5]::2])

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

result = similar_coffee()
print(result)

Solution (Python):
import math
import collections
import itertools
import heapq
import sys

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

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


if __name__ == "__main__":
    main()

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

ans = 'No'

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

print(ans)

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

import sys
import collections as cl


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


main()

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 = 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()
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
import os
if sys.platform=="darwin":
	base = os.path.dirname(os.path.abspath(__file__))
	name = os.path.normpath(os.path.join(base, '../atcoder/input.txt'))
	sys.stdin = open(name)

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

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

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


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
S = input()

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

Solution (Python):
S = input()
print('Yes' if (S[2] == S[3]) & (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

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

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

    return


if __name__ == '__main__':
    main()

Solution (Python):
s=input()

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

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

s = input().rstrip()

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

Solution (Python):
a,b,c,d,e,f=list(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):
def main():
    ans = 'cofee'
    s = list(input())
    if s[2]==s[3] and s[5]==s[4]:
        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 = 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):
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

if __name__ == "__main__":
  resolve()

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

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

Solution (Python):
S = input()

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

else:
    print('No')

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

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

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

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

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

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

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

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

Solution (Python):
s=input()
print('YNeos'[s[2::3]!=s[3:5]::2])

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

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
def gcd(*numbers): reduce(math.gcd, numbers)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
ans = 0

S = X()

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

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
def gcd(*numbers): reduce(math.gcd, numbers)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
ans = 0

S = X()

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

Solution (Python):
S=input()

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

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

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

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

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

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

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

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

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

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

Solution (Python):
s = input()
s.split()

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

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

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

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

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

Solution (Python):


import sys
input=sys.stdin.readline

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

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

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

Solution (Python):
S=input()
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 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
S = readline().decode().rstrip()
if S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else:
    print('No')

Solution (Python):
import itertools
import functools
import math
from collections import Counter

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

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

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

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

Solution (Python):


from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


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


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


def main():
    print(solve())


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

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

Solution (Python):
s = input()

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

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

else:
    print('No')

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

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

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

Solution (Python):
a = str(input().split())
b = list(a)
if b[4] == b[5] and b[7] == b[6]:
     print("Yes")
else :
     print("No")

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

Solution (Python):
a = str(input().split())
s = list(a)
if s[4] == s[5] and s[7] == s[6]:
      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 = input()
if((S[2]==S[3]) and (S[4]==S[5])):
    print('Yes')
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 = input()

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

Solution (Python):
def main():
    word = list(str(input()))
    if word[2] == word[3] and word[4] == word[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):
a = input()
if a[-1]==a[-2] and a[-3]==a[-4]:
    print("Yes")
else:
    print("No")

Solution (Python):
w = input()

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

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

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

Solution (Python):

s = input()

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

Solution (Python):
S = input()

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

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

Solution (Python):
a = input()
iff3 = a[2]
iff4 = a[3]
iff5 = a[4]
iff6 = a[5]
if iff3 == iff4 :
    if iff5 == iff6 :
        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")
    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()
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):
a2=list(input())
if a2[0]!=a2[1] and a2[2]==a2[3] and a2[4]==a2[5]:
    print('Yes')
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()
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)