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:
import sys
read = sys.stdin.buffer.read
input = sys.stdin.readline
input = sys.stdin.buffer.readline


#sys.setrecursionlimit(10**9)
#from functools import lru_cache

def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode('utf-8')


#import numpy as np

def main():
	s=input().decode()

	ans="Yes"

	if s[2]!=s[3] or s[4]!=s[5]:
		ans="No"

	print(ans)




if __name__ == "__main__":
	main()

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

main()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
print("{}".format("Yes" if (S[2] == S[3]) and (S[4] == S[5]) else "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
read = sys.stdin.buffer.read
input = sys.stdin.readline
input = sys.stdin.buffer.readline


#sys.setrecursionlimit(10**9)
#from functools import lru_cache

def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode('utf-8')

#
#import numpy as np

from itertools import combinations

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



if __name__ == "__main__":
	main()

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:
ans = "Yes"
s = input()

s = s[2:]

for i in range(2):
    j = 2 * i
    if s[j] != s[j + 1]:
        ans = "No"

print(ans)

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

Submission status: Accepted

Solution code:
a=input()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

if n[2] == n[3] and n[4] == n[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()
print("YNeos"[s[2:5:2] != s[3:6:2]::2])

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

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

Submission status: Accepted

Solution code:
inp=str(input())

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

Submission status: Accepted

Solution code:
import sys
import os
import bisect, collections, copy, itertools, math, string
def I(): return int(input())
def S(): return input()
def LI(): return list(map(int, input().split()))
def LS(): return list(input().split())

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

Submission status: Accepted

Solution code:
coffee = input()

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

Submission status: Accepted

Solution code:
a = str(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[3] == s[2] and s[5] == s[4]:
    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 = str(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:
x = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

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


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

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

Submission status: Accepted

Solution code:
import numpy as np
import scipy.sparse as sps
import scipy.misc as spm
import collections as col
import functools as func
import itertools as ite
import fractions as frac
import math as ma
import cmath as cma
import copy as cp
import sys
def sinput(): return sys.stdin.readline()
def iinput(): return int(sinput())
def imap(): return map(int, sinput().split())
def fmap(): return map(float, sinput().split())
def iarr(n=0):
    if n: return [0 for _ in range(n)]
    else: return list(imap())
def farr(): return list(fmap())
def sarr(n=0):
    if n: return ["" for _ in range(n)]
    else: return sinput().split()
def barr(n): return [False for _ in range(n)]
sys.setrecursionlimit(10**7)
MOD = 10**9 + 7; EPS = sys.float_info.epsilon
PI = np.pi; EXP = np.e; INF = np.inf

s = sinput()
flag = s[2]==s[3] and s[4]==s[5]
if flag: 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:
a = input()

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


# Generated by 1.1.7.1 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()
if s[-4]==s[-3] and s[-2]==s[-1]:
    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 = 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:
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:
# -*- coding: <encoding name> -*-

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

Submission status: Accepted

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

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

Submission status: Accepted

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

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
if S[2] == S[3] and S[-2] == S[-1]:
    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 main():
        S = list(input())

        ans = "No"

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

        print("{}".format(ans))

if __name__=="__main__":
        main()

Submission status: Accepted

Solution code:
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 
#      .      '                    Udit Gupta @luctivud         ,              
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
                            ##     ##  #######  # #  ######
                            ##     ##  ##   ##  ###    ##
                            ##     ##  ##    #  # #    ##
                            #########  #######  # #    ##
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

import sys
import math
# sys.setrecursionlimit(10**6)

def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))

def printwsp(*args): return print(*args, end="")
def printsp(*args): return print(*args, end=" ")
def printchk(*args): return print(*args, end="tst, ")

MODPRIME = int(1e9+7); BABYMOD = 998244353;
# ################################ HELPER PROGRAMS USED ###################################
# ################################## MAIN STARTS HERE #####################################
# for _testcases_ in range(int(input())):
ans = 'No'
s = input()
if len(s)==6 and s[0] != s[1] and s[2] == s[3] and s[4] == s[5]:
    ans = "Yes"
print(ans)


# #########################################################################################
'''
THE LOGIC AND APPROACH IS BY ME @luctivud.
SOME PARTS OF THE CODE HAS BEEN TAKEN FROM WEBSITES LIKE::
(I Own the code if no link is provided here or I may have missed mentioning it)
: DO NOT PLAGIARISE.
'''

Submission status: Accepted

Solution code:
S = input()
res = "No"

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

print(res)

Submission status: Accepted

Solution code:
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:
n=list(input())

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

Submission status: Accepted

Solution code:
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    s = list(input()[:-1])
    if s[2] == s[3] and s[4] == s[5]:
        print('Yes')
    else:
        print('No')


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
coffee = input()

if len(coffee) != 6:
    print("文字数が異なります")

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

s=input()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = [i for i in input()]

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

Submission status: Accepted

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

S = list(input())
t=0
if S[2]==S[3]:
    if S[4]==S[5]:
        print("Yes")
        t=1


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

Submission status: Accepted

Solution code:
# coding: utf-8
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

S = sr()
bl = False
if S[2] == S[3] and S[4] == S[5]:
    bl = True

print('Yes' if bl else 'No')

Submission status: Accepted

Solution code:
# ABC160A

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

s = input()
f(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

b=a[0]
c=a[1]
d=a[2]
e=a[3]
f=a[4]
g=a[5]

if d == e and f==g:
	print('Yes')
else:
	print('No')

Submission status: Accepted

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

if __name__ == '__main__':
    main()

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

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
arr=list(input())
if len(arr)<6:print("No")
else:
    if arr[2]==arr[3] and arr[4]==arr[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:
n = input()

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
input = lambda: sys.stdin.readline().strip()

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

main()

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

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

Submission status: Accepted

Solution code:

s = input()

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

Submission status: Accepted

Solution code:
# N, K = [int(_) for _ in input().split()]
# N = int(input())
S = input()
if S[2] == S[3] and S[4] == S[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:
N = input()
flag = False
if N[2]==N[3] and N[4]==N[5]:
    flag = True

if flag==True:
    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:
a = input()

b = list(a)

if len(a) >= 6:
	if b[2] == b[3]:
		if b[4] == b[5]:
			print("Yes")
		else:
			print("No")
	else:
		print("No")
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:
from sys import stdin

S = list(stdin.readline().rstrip())
print('Yes' if S[2]==S[3] and S[4]==S[5] else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
## A
S = [0] + list(input())
print('Yes' if S[3]==S[4] and S[5]==S[6] 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:
s = list(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:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
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 = list(input())
    if s[2]==s[3] and s[4]==s[5]:
      print("Yes")
    else:
      print("No")
    
    return

#Solve
if __name__ == "__main__":
    solve()

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

Submission status: Accepted

Solution code:
def ABC_160_A():
    S = input()

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

if __name__ == '__main__':

    ABC_160_A()

Submission status: Accepted

Solution code:
S = input()
#6文字の入力を配列S[0,1,2,3,4,5]に格納

if S[2]==S[3] and S[4]==S[5]:
    print("Yes")
#もし、配列S[2]とS[3]が等しく、かつ配列S[4]とS[5]が等しければ、
#Yesを出力する
else:
    print("No")  
#それ以外の場合は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:
s=input()

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

Submission status: Accepted

Solution code:
#  =========     /\       /|    |====/|
#      |        /  \       |    |   / |
#      |       /____\      |    |  /  |
#      |      /      \     |    | /   |
#  ========= /        \  =====  |/====|  
#  code

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
line = input()

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

print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=str(input())
if n[2]==n[3] and n[4]==n[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()
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()

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

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

j = 0

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
val = input()

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

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    s = stdin.readline()[:-1]
    print('Yes') if s[2] == s[3] and s[4] == s[5] else print('No')


if __name__ == "__main__":
    main()

Submission status: Accepted

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


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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Wed May  6 16:23:09 2020

@author: shinba
"""

N = input()

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

Submission status: Accepted

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

Submission status: Accepted

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