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:

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

yes = (S[2] == S[3] and S[4] == S[5])

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

Submission status: Accepted

Solution code:
# from math import factorial,sqrt
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque,Counter
# from decimal import Decimal, getcontext
# # getcontext().prec = 1000
# # eps = Decimal(10) ** (-100)

# import numpy as np
# import scipy as scp

# strlist = "abcdefghijklmnopqrstuvwxyz"
s = input()

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

print(ans)
# print("{:.10f}".format(ans))
# print(*ans)   # unpackして出力。間にスペースが入る
# for row in board:
#     print(*row,sep="")    #unpackして間にスペース入れずに出力する

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    #s = input().rstrip().split(' ')
    s = input()
    print('Yes' if s[2]==s[3] and s[4]==s[5] else '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
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

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

    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=raw_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()
#print(S[3],S[4])
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:
input_line = list(input())

# print(input_line)

if input_line[2]==input_line[3] and input_line[4] == input_line[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")

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:


from sys import stdin
import sys
sys.setrecursionlimit(10**8)

def getInputs():
	inputs=[]
	for line in stdin:
		line=line.split()
		inputs.append(line)
	return inputs

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


if __name__=="__main__":
	inputs=getInputs()
# 	inputs=simInputs()
	main(inputs)

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

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

Submission status: Accepted

Solution code:
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())
##################################################
S = S()
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:
s=list(input())
flag = True
if s[2]!=s[3]:
  flag=False
if s[4]!=s[5]:
  flag=False
if flag:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
S = input().strip()

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python

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

Submission status: Accepted

Solution code:
S = input().strip()
result = 'No'

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

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

if not s[4] == s[5]:
    flag = False

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Mar 28 20:58:44 2020

@author: H_Hoshigi
"""

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
# -*- coding: utf-8 -*-
# vim:fenc=utf-8 ff=unix


def solv(S):
    return (S[2] == S[3]) and (S[4] == S[5])


if __name__ == "__main__":

    S = input()
    ans = solv(S)

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

s = input().strip()

def cond():
    return s[2] == s[3] and s[4] == s[5]

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

Submission status: Accepted

Solution code:
ele =  input().strip()
if ele[2] == ele[3] and ele[4] == ele[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:
# coding:utf-8

import sys
import math
import time
#import numpy as np
import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq


def dfs(s, prev, pre):
  val[s] += Ope[s] + prev
  for i in G[s]:
    if(i == pre):
      continue
    dfs(i, val[s], s)

def bfs(sx, sy, n):
  que = deque([[sy,sx]])
  while que:
    y,x = que.popleft()
    for i,j in D:
      if(x+i<0 or y+j<0 or x+i>W-1 or y+j>H-1):
        continue
      dist = G[y+j][x+i]
      if(G[y+j][x+i] != "X"):
        if(type(G[y+j][x+i]) is str):
          G[y+j][x+i] = G[y][x]+1
          que.append([y+j,x+i])
        elif(dist>G[y][x]+1):
          G[y+j][x+i] = G[y][x]+1
          que.append([y+j,x+i])
        

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


#sys.setrecursionlimit(10**7)
#N, Q = map(int, input().split())
#G = [list(input()) for i in range(H)]
#INF = V * 10001
#A = [int(i) for i in input().split()]
#AB = [list(map(int, input().split())) for _ in range(K)]



S = str(input())
ans = "No"

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

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:
# A - Coffee

S = str(input())
ans = 'No'

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections
import sys
import numpy as np
sys.setrecursionlimit(1000000000)

#入力
s = input()
#解答
state = 0
if s[2] == s[3]:
    state = 1
else:
    print("No")
    sys.exit()
if s[4] == s[5]:
    state = 1
else:
    state = 0
    print("No")
    sys.exit()
if state == 1:
    print("Yes")
#出力

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:
tmp = str(input())
if (tmp[2]==tmp[3]) & (tmp[4]==tmp[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]:
        ans = "Yes"
    else:
        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:
S=input()
if S[2]==S[3]:
  if S[4]==S[5]:
    print('Yes')
    exit(0)
print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect
import math
from collections import deque

def sRaw():
    return input().rstrip("\r")


def iRaw():
    return int(input())


def ssRaw():
    return input().split()


def isRaw():
    return list(map(int, ssRaw()))

INF = 1 << 29



def main():
    S = sRaw()

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

if __name__ == "__main__":
    print(main())

Submission status: Accepted

Solution code:
num = input()

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

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=list(raw_input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
S = str(input())

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

Submission status: Accepted

Solution code:
S = raw_input()

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

print "No"

Submission status: Accepted

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

Submission status: Accepted

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

solution()

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:
from sys import stdin
S = (stdin.readline().rstrip())
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" 
NO = "No"

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())
hantei = 0
han = 0

if S[2] == S[3]:
    hantei = 1

if S[4] == S[5]:
    han = 1

if hantei == 1 and han == 1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

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

Submission status: Accepted

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

import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
read = sys.stdin.read


#n,a = [int(i) for i in read().split()]
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[5] and s[2]==s[3]:
    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:
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]:
    if S[4] == S[5]:
        print('Yes')
    else:
        print('No')
        exit()
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:
if __name__ == '__main__':
    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")

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:
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  s=S()

  if s[2]==s[3] and s[4]==s[5]:
    return 'Yes'
  return 'No'

# main()
print(main())

Submission status: Accepted

Solution code:
import sys
s = sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
S = input()
if S[2] == S[3]:
    if S[4] == S[5]:
        print("Yes")
        sys.exit()
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]:
    print("No")
elif s[4] != s[5]:
    print("No")
else:
    print("Yes")

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:
# デバッグ用
GBN_DEBUG = False
def dprn(s, i):
    if GBN_DEBUG: print(", " + s + " = " + str(i), end = "")
def dprns(s):
    if GBN_DEBUG: print(", " + s, end = "")
def dprni(i):
    if GBN_DEBUG: print(i, end=" ")
def endl(): 
    if GBN_DEBUG: print('')
def puts(s): print(s)

#本体ここから

S = input()
#N = int(input())
#S, T = input().split()
#N, M = map(int, input().split())
#W = [input() for _ in range(N)]
#A = list(map(int, input().split()))

#GBN_DEBUG = True

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

else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
#input = sys.stdin.readline
#文字列のときはうまく行かないのでコメントアウトすること
sys.setrecursionlimit(2147483647)

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

Submission status: Accepted

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

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

else:
    print('No')

Submission status: Accepted

Solution code:
import sys
import numpy as np
import itertools
from collections import deque

sys.setrecursionlimit(10**6)
readline = sys.stdin.readline

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

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:
# -*- coding: utf-8 -*-
S = str(input())
print("Yes" if S[2] == S[3] and S[4] == S[5] else "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")


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:
x = list(input())
f = False
if x[2]==x[3]:
  if x[4]==x[5]:
    f = True
if 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:
def main():
    S = input()
    if S[2]==S[3] and S[4]==S[5]:
        print('Yes')
        return
    print('No')


if __name__ == '__main__':
    main()

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

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

Submission status: Accepted

Solution code:
from sys import stdin
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:
# (int(x) for x in input())
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 = input() # 入力が1つ
# map(int, input().split()) # 入力が複数

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

Submission status: Accepted

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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

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


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


# 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
    print(solve(S))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

def resolve():
    S=input()

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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
S = input()

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

print("Yes" if ans 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:
n = input()
# a,b = map(int,input().split())
# A = list(map(int,input().split()))
# An = [list(map(int,input().split())) for i in range(n)]
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]==s[3] and s[4]==s[5]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
#python3
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])&(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:
# -*- 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:
s = input()
a=s[2]
b=s[3]
c=s[4]
d=s[5]
if a==b:
    if c==d:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Submission status: Accepted

Solution code:
S = list(str(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()

a=list(S)

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
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")

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

ans = 'No'

if s[2]==s[3] and s[4]==s[5]:
    ans = 'Yes'

print(ans)

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()
print("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]:
  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()

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

if N[2] == N[3] and N[4] == N[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:
def main():
    from builtins import int, map, list, print
    import sys
    sys.setrecursionlimit(10 ** 6)

    input = sys.stdin.readline
    input_list = (lambda: input().rstrip().split())
    input_number = (lambda: int(input()))
    input_number_list = (lambda: list(map(int, input_list())))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
if s[4] == s[5] and s[2]==s[3]:
    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:
# print('input >>')
S = input()

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

Submission status: Accepted

Solution code:
s = input()
# a,b = map(int, input().split())
# l = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
import sys

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

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

print('Yes' if bl else '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')