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



Sample input:
sippuu


Sample output:
Yes

Submission status: Accepted

Solution code:
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
import sys,bisect,string,math,time,functools,random
def Golf():*a,=map(int,open(0))
def I():return int(input())
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def LI():return [int(i) for i in input().split()]
def LI_():return [int(i)-1 for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def GI(V,E,Directed=False,index=0):
    org_inp=[];g=[[] for i in range(n)]
    for i in range(E):
        inp=LI();org_inp.append(inp)
        if index==0:inp[0]-=1;inp[1]-=1
        if len(inp)==2:
            a,b=inp;g[a].append(b)
            if not Directed:g[b].append(a)
        elif len(inp)==3:
            a,b,c=inp;aa=(inp[0],inp[2]);bb=(inp[1],inp[2]);g[a].append(bb)
            if not Directed:g[b].append(aa)
    return g,org_inp
def GGI(h,w,boundary=1,search=[],replacement_of_found='.',mp_def={'#':1,'.':0}):
#h,w,g,sg=GGI(h,w,boundary=1,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0}) # sample usage
    mp=[boundary]*(w+2);found={}
    for i in range(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
    mp+=[boundary]*(w+2)
    return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def bit_combination(k,n=2):return [[tb//(n**bt)%n for bt in range(k)] for tb in range(n**k)]
def show(*inp,end='\n'):
    if show_flg:print(*inp,end=end)
def show2d(g,h,w):
    for i in range(h):show(g[i*w:i*w+w])

YN=['YES','NO'];Yn=['Yes','No']
mo=10**9+7
inf=float('inf')
l_alp=string.ascii_lowercase
#sys.setrecursionlimit(10**7)
input=lambda: sys.stdin.readline().rstrip()

def ran_input():
    n=random.randint(4,16)
    rmin,rmax=1,10
    a=[random.randint(rmin,rmax) for _ in range(n)]
    return n,a

show_flg=False
show_flg=True

ans=0
s=input()
if s[2]==s[3] and s[4]==s[5]:
    a=0
else:
    a=1
ans=Yn[a]
print(ans)

Submission status: Accepted

Solution code:
x = input()
if len(x) == 6:
    if x[2] == x[3]:
        if x[4] == x[5]:
            print("Yes")
        else:
            print("No")
    else:
        print("No")
else:
    print("No")

Submission status: Accepted

Solution code:
from collections import *
from heapq import *
from itertools import *
from fractions import gcd
import sys
from decimal import *
import copy
from bisect import *
input=lambda :sys.stdin.readline().rstrip()


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

Submission status: Accepted

Solution code:
data = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())

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

Submission status: Accepted

Solution code:
S = input()

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(S: str):

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


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    solve(S)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]

IN=lambda : map(int, input().split())
mod=1000000007

#+++++

def main():
	#a = int(input())
	#b , c = IN()
	s = input()
	is_coffee_like = (s[2]==s[3]) and (s[4]==s[5])
	ret = 'Yes' if is_coffee_like else 'No'
	print(ret)
	
#+++++
isTest=False

def pa(v):
	if isTest:
		print(v)
		
def input_clipboard():
	import clipboard
	input_text=clipboard.get()
	input_l=input_text.splitlines()
	for l in input_l:
		yield l

if __name__ == "__main__":
	if sys.platform =='ios':
		if input_method==input_methods[0]:
			ic=input_clipboard()
			input = lambda : ic.__next__()
		elif input_method==input_methods[1]:
			sys.stdin=open('inputFile.txt')
		else:
			pass
		isTest=True
	else:
		pass
		#input = sys.stdin.readline
			
	ret = main()
	if ret is not None:
		print(ret)

Submission status: Accepted

Solution code:
hoge = input()

def equal(list,i):
    if list[i] == list[i+1]:
        return 0
    else:
        return 1

a = equal(hoge,2)
b = equal(hoge,4)
if a + b == 0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

if __name__ == '__main__':
    print(solve())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=str(input())

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

else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
len = len(S)
flag = 0
if S[2] != S[3]:
    print("No")
    flag = 1
elif S[4] != S[5]:
    print("No")
    flag = 1
if flag == 0:
    print("Yes")

Submission status: Accepted

Solution code:
S = input()

st3 = S[2]
st4 = S[3]
st5 = S[4]
st6 = S[5]

if st3 == st4 and st5 == st6:
    print("Yes")

else:
    print("No")

Submission status: Accepted

Solution code:
user_input = input()
S = user_input.lower()
third = S[2]
forth = S[3]
fifth = S[4]
sixth = S[5]
if third is forth and fifth is sixth:
    print("Yes")
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str = str(input())

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

Submission status: Accepted

Solution code:
str_1 = input()
char_list = list(str_1)
checker = 0
if char_list[2] == char_list[3]:
    if char_list[4] == char_list[5]:
        checker = 1

if checker == 1:
  print("Yes")

if checker == 0:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

s = list(input())

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
seq = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
if S[2] == S[3]:
    if S[4] == S[5]:
        print('Yes')
        exit()

print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
line = input()

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

Submission status: Accepted

Solution code:
ls = list(map(str,input()))
if (ls[2] == ls[3]) and (ls[4] == ls[5]):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
s=input()
S=[str(c) for c in (s)]
if S[2]==S[3] and S[4]==S[5]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
I =str(input())


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

else:
    print("No")

Submission status: Accepted

Solution code:
import sys
readline=sys.stdin.readline

S=readline().rstrip()

print(("No","Yes")[S[2]==S[3] and S[4]==S[5]])

Submission status: Accepted

Solution code:
s=input()
print(['No','Yes'][s[2]==s[3] and s[4]==s[5]])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

N = input()

N = list(N)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
char = []
char = str(input())
cahr_list = list(char)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
judge = False
if (s[2] == s[3]):
  if (s[4] == s[5]):
    judge = True
if (judge):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_tuple(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_col(H, n_cols):
    '''
    H is number of rows
    n_cols is number of cols
    A列、B列が与えられるようなとき
    '''
    ret = [[] for _ in range(n_cols)]
    for _ in range(H):
        tmp = list(map(int, read().split()))
        for col in range(n_cols):
            ret[col].append(tmp[col])
    return ret


def read_matrix(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


def read_map(H):
    '''
    H is number of rows
    文字列で与えられた盤面を読み取る用
    '''
    return [read()[:-1] for _ in range(H)]


def read_map_as_int(H):
    '''
    #→1,.→0として読み込む
    '''
    ret = []
    for _ in range(H):
        ret.append([1 if s == '#' else 0 for s in read()[:-1]])
        # 内包表記はpypyでは若干遅いことに注意
        # #numpy使うだろうからこれを残しておくけど
    return ret


MOD = 10**9 + 7
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  # , insort_left, insort_right

S = input()

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

Submission status: Accepted

Solution code:
inputArray = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

s = stdin.readline().rstrip()

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

Submission status: Accepted

Solution code:
s = input()
s2 = s[2]
s3 = s[3]
s4 = s[4]
s5 = s[5]
output = "No"
if s2 == s3 and s4 == s5:
    output = "Yes"
print(output)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
lst = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input().split()
a = list(a[0])

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

Submission status: Accepted

Solution code:
#--------------------------------------------
#ライブラリ呼び出し
import sys
import math
#from math import sqrt
#--------------------------------------------
N = input()
if N[2] == N[3] and N[4] == N[5]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

  return

if __name__ == "__main__":
  solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()

ans="No"

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()
a=S[2]
b=S[3]
d=S[-2]
e=S[-1]
if(a==b):
  if(d==e):
    print('Yes')
  else:
    print('No')
else:
  print('No')

Submission status: Accepted

Solution code:
s = input()
w = [d for d in s]
if w[2] == w[3] and w[4] == w[5]:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s=input()
if s[3-1]==s[4-1] and s[5-1]==s[6-1]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
a = 0
if S[2] == S[3]:
  a += 1

if S[4] == S[5]:
  a += 1

if a == 2:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
a = S[2]
b = S[3]
c = S[4]
d = S[5]
if a == b and c == d:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

n = input()

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

print('No')

Submission status: Accepted

Solution code:
S=list(input())

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

else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

print(solve(S))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf-8
s = input()
if (s[2] == s[3]) and (s[4] == s[5]):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
S = input()


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


print(main(S))

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
S = str(input())

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
"""


def int_as_array(num): return list(map(int, [y for y in str(num)]))


def array_as_int(arr): return int(''.join(map(str, arr)))


def read_int(): return int(input())


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


def array_to_string(arr, sep=' '): return sep.join(map(str, arr))


def matrix_to_string(arr, sep=' '): return '[\n' + '\n'.join(
    [sep.join(map(str, row)) for row in arr]) + '\n]'


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


string = input()
solve(string)

Submission status: Accepted

Solution code:
S = input()
#print('S=', S)

list_S = list(S)
#print('list_S', list_S)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
s_list = list(s)
j=False
if(s_list[2]==s_list[3]):
    if s_list[4]==s_list[5]:
       j=True

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

Submission status: Accepted

Solution code:
a = list(input())

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

Submission status: Accepted

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


main()

Submission status: Accepted

Solution code:

s = input()

s_list = list(s)

ans = 'No'

index3 = s_list[2]
index4 = s_list[3]
index5 = s_list[4]
index6 = s_list[5]

if index3 == index4 and index5 == index6 :
    ans = 'Yes'

print(ans)

Submission status: Accepted

Solution code:
sss = input()


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

Submission status: Accepted

Solution code:
from sys import stdin

a = stdin.readline().rstrip()

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

Submission status: Accepted

Solution code:
s = str(input())
S = list(s)

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

Submission status: Accepted

Solution code:


############ ---- USER DEFINED INPUT FUNCTIONS ---- ############
def inp():
    return(int(input().rstrip()))
def inlt():
    return(list(map(int,input().rstrip().split())))
def insr():
    s = input().rstrip()
    return(s[:len(s) - 1])
def invr():
    return(map(int,input().rstrip().split()))
################################################################
s = input().strip()
if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
else:
    print('No')
#print()

Submission status: Accepted

Solution code:
s = input()
flag = 0
if s[2] == s[3]:
  if s[4] == s[5]:
    flag = 1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
s=input()
if s[2]==s[3] and s[4]==s[5]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
word = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=list(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

s = input()
# print(s)
# print(s[2:3])
# print(s[3:4])
# print(s[4:5])
# print(s[5:6])

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

Submission status: Accepted

Solution code:
str = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
from collections import Counter

s = sys.stdin.readline().strip()

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

Submission status: Accepted

Solution code:

a = input()

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from math import sqrt
from collections import Counter, defaultdict

input = sys.stdin.readline


def I():
    return int(input())


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


def LI():
    return list(MI())


def LIN(n: int):
    return [I() for _ in range(n)]


inf = float("inf")
mod = 10 ** 9 + 7


def main():
    s = input()

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
c = list(input())
if c[2] == c[3] and c[4] == c[5]:
    print("Yes")
    exit()
print("No")

Submission status: Accepted

Solution code:
#coding:utf-8

            
def main():
    s = input()

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

Submission status: Accepted

Solution code:
string = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n=input()
if n[2]==n[3] and n[5]==n[4]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
S = list(input())
ans = "No"

if S[2] == S[3]:
    if S[4] == S[5]:
        ans ="Yes"

print(ans)

Submission status: Accepted

Solution code:
import sys
readline=sys.stdin.buffer.readline
s=readline().rstrip().decode()
if s[2]==s[3] and s[4]==s[5]:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
def Main(S):
    return "Yes" if S[2] == S[3] and S[4] == S[5] else "No"

def main():
    S = str(input())
    print(Main(S))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
S= list(input())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import numpy as np

s = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#200329A
S = str(input())
#print(S[3])
flag = 0
if S[2] == S[3]:
    if S[4] == S[5]:
        flag = 1

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

Submission status: Accepted

Solution code:
rets = "No"
given = input()
if given[-1] == given[-2] and given[-3] == given[-4]:rets = "Yes"
print(rets)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
S = list(input())
if S[2] == S[3] and S[4] == S[5]:
    print("Yes")
else:
    print("No")