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

Submission status: Accepted

Solution code:
import sys
from io import StringIO
import unittest

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

if __name__ == "__main__":
    resolve()

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:
#!/usr/bin/env python3
def YesNo(T):
    if T:
        print('Yes')
    else:
        print('No')
S = str(input())
YesNo(S[2] == S[3] and S[4] == S[5])

Submission status: Accepted

Solution code:
sel='A'

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

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

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

# if sel=='D':

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,b,c,d,e,f = input()
if (c==d) and (e==f) : 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:
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:
k=input()
def s(i):
  return k[i-1:i]
if s(3)==s(4) and s(5)==s(6):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
# n = int(input())
# a, b = map(int, input().split())
# k = list(map(int, input().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[2] == s[3])&(s[4] == s[5]):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
c=0
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:
def main():
    s = input()

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


if __name__ == '__main__':
    main()

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:
import sys
def fastio():
    from io import StringIO
    from atexit import register
    global input
    sys.stdin = StringIO(sys.stdin.read())
    input = lambda : sys.stdin.readline().rstrip('\r\n')
    sys.stdout = StringIO()
    register(lambda : sys.__stdout__.write(sys.stdout.getvalue()))
fastio()

INF = 10**20
MOD = 10**9 + 7
I = lambda:list(map(int,input().split()))
# from math import gcd
from math import ceil
from collections import defaultdict as dd, Counter
from bisect import bisect_left as bl, bisect_right as br

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

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:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline

from decimal import *

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

##### 累乗 #####
# pow(x, y, z) -> x**y % z

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

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

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

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

	#print(ans)


#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# special thanks :
#  https://nagiss.hateblo.jp/entry/2019/07/01/185421
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
def int_sqrt2(n):
    def f(prev):
        while True:
            m = (prev + n / prev) / 2
            if m >= prev:
                return prev
            prev = m

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

# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res

# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

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

# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
	# comb = Combination(n+r-1, mod)
	# return comb(n+r-1, r)
    return combination(n+r-1, r, mod)

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

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

    def make_factorial_list(self, n):
        # 階乗のリストと階乗のmod逆元のリストを返す O(n)
        # self.make_modinv_list()が先に実行されている必要がある
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        # 0からnまでのmod逆元のリストを返す O(n)
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

if __name__ == "__main__":
	main()

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()
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: utf-8 -*-

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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 = input().lower()
if len("string") <= 6:
  if str[2] == str[3] and str[4] == str[5]:
    print("Yes")
  else: 
    print("No")
else:
  exit()

Submission status: Accepted

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

Submission status: Accepted

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#sは文字列
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(raw_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] and len(a)==6:
    print('Yes')
else: 
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
I = input().split()
S = I[0]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=[]
s=input()
if str.islower(s)==True and s[2]==s[3] and s[4]==s[5]:
    print("Yes")
else:
    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()
T = list(S)

if T[2] == T[3] and T[4] == T[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]:
    print("No")
else:
    if 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:
line = input().strip()

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

Submission status: Accepted

Solution code:
usr = input()
arr = [2,4]
bol = True

for i in arr:
    if not (usr[i] == usr[i+1]):
        bol = False

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def count_section_by_zero(data):
  count = 0
  flg = False
  start = 0
  for i, d in enumerate(data):
    if flg is False and d != 0:
      count += 1
      flg = True
      
    if d == 0:
      flg = False
  return count

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

def input_list_str():
  return list(map(str, input().split()))

def lcm_base(x, y):
    return (x * y) // fractions.gcd(x, y)

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)

def gcd(*numbers):
    return reduce(fractions.gcd, numbers)

def gcd_list(numbers):
    return reduce(fractions.gcd, numbers)

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

# 2で割り切れる回数
def divide_two(arg):
  c = 0
  while True:
    if c >= 2:
      break
    if arg % 2 != 0:
      break
    arg //= 2
    c += 1
  return c

# 素因数分解
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

def main():
  s = input()
  if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
  else:
    print('No')
  
import math
import fractions
import collections
import itertools
from functools import reduce
main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
if len(S) == 6:
    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
input = sys.stdin.readline
from collections import defaultdict, Counter

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

Submission status: Accepted

Solution code:
s = input()
ret = "No"
if s[2] == s[3] and s[4]==s[5]:
    ret = "Yes"
print("{}".format(ret))

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

Submission status: Accepted

Solution code:
import numpy as np

#k ,n = list(map(int,(input().split())))
#a = list(map(int,(input().split())))
#a = np.array(a)
#sp = np.diff(a)
#print((sum(sp)))

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

v = list(S)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().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("")

S1 = str(S[-1])
S2 = str(S[-2])
S3 = str(S[-3])
S4 = str(S[-4])

n = 0

if S1 == S2:
    n += 1
if S3 == S4:
    n += 1

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

Submission status: Accepted

Solution code:
neko = input()
nyan = list(neko)
 
if nyan[2] == nyan[3] and nyan[4] == nyan[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:
t=str(input())
if(t[2]==t[3] and t[4]==t[5] and len(t)==6):
	print("Yes")
else:
  print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = input()
for i in range(0, len(S)):
    if ((S[2]==S[3])&(S[4]==S[5])):
        print("Yes")
        break
    else:
        print("No")
        break

Submission status: Accepted

Solution code:
s = input()

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

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:
import sys

input = sys.stdin.readline

S = input().strip()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str=input(" ")
#for i in range(len(str)):
 #   print(str[i])
    # TODO: write code...
if((str[2]==str[3]) and (str[4]==str[5])):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import math


def test(data):
    result = False
    if data[2] == data[3]:
        if data[4] == data[5]:
            result = True
    return result
    


data = input()

if test(data):
    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:
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()

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

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

Submission status: Accepted

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

flg=0
if(S[2]==S[3]):
  flg=flg+1
  if(S[4]==S[5]):
    flg=flg+1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
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:
neko = input()
nyan = list(neko)

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

Submission status: Accepted

Solution code:
s=input()
a=set(s[2:4])
b=set(s[4:6])
if len(a)==1 and len(b)==1:
	print('Yes')
else:
	print('No')

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
s = input()
flag = True
if len(s) != 6:
    flag = False

for i in s:
    if ord(i) < 97 or ord(i) > 122:
        flag = False
if len(s) == 6:
    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:
a = input()
a = list(a)
if (a[2] == a[3]) & (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:
i = input()
if i[3] == i[2] and i[4] == i[5]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
S = list(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:
import sys

for S in sys.stdin:
    if(S[2]==S[3] and S[4]==S[5]):
        print("Yes")
    else:
        print ("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
s_serve = list(s)

if s.count(s_serve[0])==1 and s.count(s_serve[1])==1 and s_serve[2]==s_serve[3] and s_serve[4]==s_serve[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:
a = input()
a = str(a)

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

Submission status: Accepted

Solution code:
s=input()[2::];print('Yes' if len(set(s[:2]))==1 and len(set(s[2:]))==1 else '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:
string = input()
if string[2]==string[3] and string[4]==string[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]:
    print("No")
else:
    if s[4] != s[5]:
        print("No")
    else:
        print("Yes")

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


b=False
if a[2]==a[3]:
    if a[4]==a[5]:
        b=True


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

Submission status: Accepted

Solution code:
s=input()[2::] 
print('Yes' if len(set(s[:2]))==1 and len(set(s[2:]))==1 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 = 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('Yes' if S[2] == S[3] and S[4] == S[5] 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 len(set(list(S[2:4]))) == len(set(list(S[4:6]))) == 1:
    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()

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].__eq__(S[3]) and S[4].__eq__(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())
S = S.lower()
if len(S) == 6:
    if S[2] == S[3] and 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:
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 = []
cont = 0
for i in S:
    l.append(i)

if l[2] == l[3]:
    if l[4] == l[5]:
        cont = 1

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

Submission status: Accepted

Solution code:
i_str = input()
anser = 'No'

if i_str[2:3] == i_str[3:4]:
  if i_str[4:5] == i_str[5:6]:
    anser = 'Yes'
    
print(anser)

Submission status: Accepted

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

Submission status: Accepted

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


main()

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

# 判定

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


# 答えの出力
print(ans)

Submission status: Accepted

Solution code:

import numpy as np
from functools import *
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline



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


def II():
    return int(input())

directions=np.array([[1,0],[0,1],[-1,0],[0,-1]])
directions = list(map(np.array, directions))

mod = 10**9+7


def nCr(n, r):
    """
    Calculate the number of combination (nCr = nPr/r!).
    The parameters need to meet the condition of n >= r >= 0.
    It returns 1 if r == 0, which means there is one pattern
    to choice 0 items out of the number of n.
    """
    if n<r:
        return 0
    # 10C7 = 10C3
    r = min(r, n-r)

    # Calculate the numerator.
    numerator = 1
    for i in range(n, n-r, -1):
        numerator *= i

    # Calculate the denominator. Should use math.factorial?
    denominator = 1
    for i in range(r, 1, -1):
        denominator *= i

    return numerator // denominator

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