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

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

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

Solution (Python):

import os

def remove_empty(target_list: list):
    empty_removed_list = [x for x in target_list if x]
    return empty_removed_list

def get_stdin_str_list():
    input_str = input().strip()
    input_str_list = input_str.split()
    return input_str_list

def get_stdin_int_list():
    input_str_list = get_stdin_str_list()
    input_int_list = list(map(input_str_list, int))
    return input_int_list


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

Solution (Python):


import sys
import math
import collections
import itertools
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]

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


import sys
import math
import collections
import itertools
from inspect import currentframe
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]


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

S_list = []
for i in S:
    S_list.append(i)

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

Solution (Python):
S = input()

S_list = []
for i in S:
    S_list.append(i)

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

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

Solution (Python):

S = input()
Slist = list(S)
if Slist[2] == Slist[3] and Slist[4] == Slist[5]:
    print('Yes')
else:
    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):
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('YNeos'[s[2]!=s[3]or 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):
import math
import string
import collections
from collections import Counter


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


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


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor



dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]

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

Solution (Python):
input_value = input()

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

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

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

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

Solution (Python):
S = input()

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

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

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

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

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

if __name__ == '__main__':
    main()

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

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

Solution (Python):






from sys import stdin,setrecursionlimit










setrecursionlimit(10**6+1)
input=stdin.readline

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

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

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

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

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

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

Solution (Python):
a,b,c,d,e,f=input()
if c==d and e==f:
  print("Yes")
else:
  print("No")

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

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

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

Solution (Python):
s=input()

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

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

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


def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    s=input()
    
    if s[2]==s[3] and s[4]==s[5]:
        print("Yes")
    else:
        print("No")

main()

Solution (Python):
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
s = readline().rstrip().decode('utf-8')

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

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

print("No")

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

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

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

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

print("No")

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

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

x = list(input())
if(judge(x) == 0):
    print("Yes")
else:
    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[5]==s[4]:
    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):
z = input()
b=0

if z[2] == z[3]:
    if z[4] == z[5]:
        print('Yes')
        b  = 1


if b==0:
    print('No')

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

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

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

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

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

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

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

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

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

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

s = input()
res = "Yes" if s[2] == s[3] and s[4] == s[5] else "No"
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):
import re
s = str(input())
r = re.match(r"(.)(.)(.)(.)(.)(.)", s)
if r.group(3) == r.group(4):
    if r.group(5) == r.group(6):
        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 len(s) <  6:
    print('-1')

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

Solution (Python):

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


if __name__ == "__main__":
    main()

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

Solution (Python):
S = input()

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

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

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

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, deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect

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


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


def LS(): return [list(x) for x in sys.stdin.readline().split()]


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


def LIR(n):
    return [LI() for i in range(n)]


def SR(n):
    return [S() for i in range(n)]


def LSR(n):
    return [LS() for i in range(n)]


sys.setrecursionlimit(1000000)
mod = 1000000007


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


if __name__ == "__main__":
    solve()

Solution (Python):

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

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

Solution (Python):
inp = input()

def isvalid(inp):
    if len(inp) < 6:
        return 'No'
    if not inp.islower():
        return 'No'
    
    if inp[2] == inp[3] and inp[4] == inp[5]:
        return 'Yes'
    return 'No'
    
print(isvalid(inp))

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[-1] == S[-2]:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):

s = input()
h = []
for i in range(len(s)):
    h.append(s[i])

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

print(ans)

Solution (Python):

letter = input()
letters = [a for a in letter]
if letters[2] == letters[3] and letters[4] == letters[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("Yes" if s[2]==s[3] and s[4]==s[5] else "No")

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

Solution (Python):
はいれ=input
出せ=print
文字列 = はいれ()
出せ("Yes" if 文字列[2]==文字列[3] and 文字列[4]==文字列[5] else "No")

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

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

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

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

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

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

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

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

Solution (Python):
import sys
from io import StringIO
import unittest

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

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

Solution (Python):
sel='A'

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

if sel=='B':
    X=int(input())
    ans=0
    ans+=(X//500)*1000
    ans+=((X%500)//5)*5
    print(ans)

if sel=='C':
    K,N=map(int,input().split())
    A=[int(i) for i in input().split()]
    d=[A[0]+K-A[-1]]
    for i in range(N-1):
        d.append(A[i+1]-A[i])
    d.sort()
    print(K-d[-1])

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

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

Solution (Python):
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):
k=input()
def s(i):
  return k[i-1:i]
if s(3)==s(4) and s(5)==s(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):
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]:
    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())
cond1 = S[2] == S[3]
cond2 = S[4] == S[5]
if cond1 & cond2:
  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[3]==s[2] and s[4]==s[5]:
    print('Yes')
else:
    print('No')

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

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

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

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

Solution (Python):
import sys
def fastio():
    from io import StringIO
    from atexit import register
    global input
    sys.stdin = StringIO(sys.stdin.read())
    input = lambda : sys.stdin.readline().rstrip('\r\n')
    sys.stdout = StringIO()
    register(lambda : sys.__stdout__.write(sys.stdout.getvalue()))
fastio()

INF = 10**20
MOD = 10**9 + 7
I = lambda:list(map(int,input().split()))

from math import ceil
from collections import defaultdict as dd, Counter
from bisect import bisect_left as bl, bisect_right as br

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

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

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

Solution (Python):

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

from decimal import *

























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

inf = float('inf')
mod = 1000000007




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

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

	







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

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



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


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

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



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

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

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

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

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

if __name__ == "__main__":
	main()

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

Solution (Python):

"""
Created on Sat Mar 28 20:51:13 2020

@author: naoki
"""

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

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

Solution (Python):

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

Solution (Python):
a = input()

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

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

Solution (Python):
S = input()
flag = True
if (S[2] != S[3]):
    flag = False
if (S[4] != S[5]):
    flag = False

if flag:
    print('Yes')
else:
    print('No')

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

Solution (Python):
str = input().lower()
if len("string") <= 6:
  if str[2] == str[3] and str[4] == str[5]:
    print("Yes")
  else: 
    print("No")
else:
  exit()

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

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

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

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

if __name__ == "__main__":
    main()

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