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

Submission status: Accepted

Solution code:
L = list(input())
if L[2]==L[3] and L[4]==L[5]:
  print('Yes')
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:
# 1行目の入力を文字列として扱う
S = input()

# 答えの準備
ans = 'No'

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

def check(s, n, m):
    if s[n-1] == s[m-1]:
        return True
    return False

if check(s, 3, 4) and check(s, 5, 6):
    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:
a=input()
if a[0] != a[1] and a[2] == a[3] and a[4] == a[5]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
S = input()
m = list(S)
ans = 'No'

if (m[2] == m[3]) and (m[4] == m[5]):
  ans = 'Yes'

print(ans)

Submission status: Accepted

Solution code:
s = list(input())

ans = "No"

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input().split()
if S[0][2] == S[0][3] and S[0][4] == S[0][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_list[2] == S_list[3]:
    if S_list[4] == S_list[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 = input()
if len(s) == 6:
    if s[5] == s[4] and s[2] == s[3]:
        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()

li = list(s)

if (li[2] == li[3]) & (li[4] == li[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()
lowerCase = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'}
allLower = True
for i in S:
    if i not in lowerCase:
        allLower = False
        break
if len(S)==6 and allLower:
    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()

S3 = S[2]
S4 = S[3]

S5 = S[4]
S6 = S[5]

if S6 == S5 and S3 == S4:
  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 is_like_coffee(s):
  return s[2] == s[3] and s[4] == s[5]

S = input()

if is_like_coffee(S):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
input_str = str(input())

result = (input_str[2] == input_str[3]) and (input_str[4] == input_str[5])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)

S = readline().decode('utf-8').strip()
try:
    if S[2] == S[3] and S[4] == S[5]:
        print('Yes')
    else:
        print('No')
except:
    print('No')

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=list(input())
ans=True
if S[2]!=S[3]:
  ans=False
if S[4]!=S[5]:
  ans=False
  
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:
input_line = input()

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

Submission status: Accepted

Solution code:
i = input()

san = i[2]
yon = i[3]
go = i[4]
roku = i[5]

if san == yon and go ==roku:
    print("Yes")
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
s = input()

res = 0
if s[2] == s[3]:
    if s[4] == s[5]:
        res += 1

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

Submission status: Accepted

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

ans = True
if S[2]!=S[3]:
  ans = False
if S[4]!=S[5]:
  ans = False
if ans:
  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:
a, b, c, d=input()[2:]
print('YNeos'[(a, c) != (b, d)::2])

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

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

else:
    print('No')

Submission status: Accepted

Solution code:
from sys import stdin


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


main()

Submission status: Accepted

Solution code:
S = map(str, input())

a = next(S)
b = next(S)
c = next(S)
d = next(S)
e = next(S)
f = next(S)

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

Submission status: Accepted

Solution code:
s = input()
li = list(s)
if li[2] == li[3] and li[4] == li[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[4]) == (S[3], 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 = 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]) & (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 print('No')

Submission status: Accepted

Solution code:
s = input()

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

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

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


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

Submission status: Accepted

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

Submission status: Accepted

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

print(solve())

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

a = S[2]
b = S[3]

c = S[4]
d = S[5]

def main():
    if (a == b) and (c == d):
        print('Yes')
    else:
        print('No')

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:
#!/usr/bin/python

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

Submission status: Accepted

Solution code:
def is_string_coffee(s):
  return (s[-1]==s[-2]) and (s[-3]==s[-4])

s=raw_input()
if(is_string_coffee(s)):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/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.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    solve(S)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

s_list = list(s)

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

Submission status: Accepted

Solution code:
from sys import stdin


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


if __name__ == "__main__":
    main()

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 sys

def main():
    text = sys.stdin.readline().rstrip()
    if text[2] == text[3] and text[4] == text[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:
S=list(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
str = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1000000000)
import math
from fractions import gcd
def lcm(a, b): return a * b // gcd(a, b)
from itertools import count, permutations
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok

def get_inv(n, modp):
    return pow(n, modp-2, modp)

def factorials_list(n, modp):    # 10**6
    fs = [1]
    for i in range(1, n+1):
        fs.append(fs[-1] * i % modp)
    return fs

def invs_list(n, fs, modp):     # 10**6
    invs = [get_inv(fs[-1], modp)]
    for i in range(n, 1-1, -1):
        invs.append(invs[-1] * i % modp)
    invs.reverse()
    return invs

def comb(n, k, modp):
    num = 1
    for i in range(n, n-k, -1):
        num = num * i % modp
    den = 1
    for i in range(2, k+1):
        den = den * i % modp
    return num * get_inv(den, modp) % modp

def comb_from_list(n, k, modp, fs, invs):   
    return fs[n] * invs[n-k] * invs[k] % modp

#

class UnionFindEx:
    def __init__(self, size):
        #正なら根の番号、負ならグループサイズ
        self.roots = [-1] * size
    def getRootID(self, i):
        r = self.roots[i]
        if r < 0:   #負なら根
            return i
        else:
            r = self.getRootID(r)
            self.roots[i] = r
            return r
    def getGroupSize(self, i):
        return -self.roots[self.getRootID(i)]
    def connect(self, i, j):
        r1, r2 = self.getRootID(i), self.getRootID(j)
        if r1 == r2:
            return False
        if self.getGroupSize(r1) < self.getGroupSize(r2):
            r1, r2 = r2, r1
        self.roots[r1] += self.roots[r2]    #サイズ更新
        self.roots[r2] = r1
        return True

Yes = 'Yes'
No = 'No'

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


main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# A - Coffee
# 標準入力の取得
S = input()

# "coffee"に似ているかどうか判定
if S[2] == S[3] and S[4] == S[5]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#abc160 a
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())
list = list(s)

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

Submission status: Accepted

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

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

SS = list(S)

if SS[2] == SS[3] and SS[4] == SS[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:
i = input()
if len(i) < 6:
    print('No')
else:
    if i[2] == i[3] and i[4] == i[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()

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

Submission status: Accepted

Solution code:
s = input()

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

else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#文字列の入力
S = input()
S_list = list(S)
if((S_list[2]==S_list[3])and(S_list[4]==S_list[5])):
    print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
## coding: UTF-8
s = input()
#print(S[1])

answer = 'Yes'

if(s[2] != s[3]):
    answer = 'No'
if(s[4] != s[5]):
    answer = 'No'

print(answer)

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()
a=0
if s[2]==s[3]:
  a=a+1

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

def io():
    s = input()
    coffee(s)

if __name__=='__main__':
    io()

Submission status: Accepted

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

Submission status: Accepted

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

###
# main
if(__name__ == '__main__'):
    # input
    ans = "No"
    s = input()
    if s[2] == s[3]:
        if s[4] == s[5]:
            ans = "Yes"

    print(ans)
# else:
    # do nothing

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
input = stdin.readline

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
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())
n = 0
if len(s) == 6:
  if s[2] ==s [3]:
    if s[4] == s[5]:
      n = 1

if n == 0:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
s = list(input())
answer = "No"

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

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:
import sys
def input(): return sys.stdin.readline().rstrip()

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

Submission status: Accepted

Solution code:
mod = 10**9 + 7

def iip(listed = False):
    ret = [int(i) for i in input().split()]
    if len(ret) == 1 and not listed:
        return ret[0]
    return ret

def soinsuu_bunkai(n):
    ret = []
    for i in range(2, int(n**0.5)+1):
        while n % i == 0:
            n //= i
            ret.append(i)
        if i > n:
            break
    if n != 1:
        ret.append(n)
    return ret


def conbination(n, r, mod, test=False):
    if n <=0:
        return 0
    if r == 0:
        return 1
    if r < 0:
        return 0
    if r == 1:
        return n
    ret = 1
    for i in range(n-r+1, n+1):
        ret *= i
        ret = ret % mod

    bunbo = 1
    for i in range(1, r+1):
        bunbo *= i
        bunbo = bunbo % mod

    ret = (ret * inv(bunbo, mod)) % mod
    if test:
        #print(f"{n}C{r} = {ret}")
        pass
    return ret


def inv(n, mod):
    return power(n, mod-2)

def power(n, p):
    if p == 0:
        return 1
    if p % 2 == 0:
        return (power(n, p//2) ** 2) % mod
    if p % 2 == 1:
        return (n * power(n, p-1)) % mod

#####################################################ライブラリ集ここまで

def main():
    s = input()
    if s[2] != s[3]:
        print("No")
        return 0
    if s[4] != s[5]:
        print("No")
        return 0
    print("Yes")


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

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

Submission status: Accepted

Solution code:

import collections


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

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

Submission status: Accepted

Solution code:
S = list(str(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:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

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

Submission status: Accepted

Solution code:
def is_same(str):
  assert len(str) == 6
  if str[2] != str[3]:
    return False
  if str[4] != str[5]:
    return False
  return True

if __name__ == "__main__":
  s = list(input())

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

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:
a=list(input())
#print(a)
if a[2]==a[3] and a[4]==a[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:

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

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

Submission status: Accepted

Solution code:
ina = input()
a=0
b=0
if ina[2]==ina[3]:
  a=1
if ina[4]==ina[5]:
  b=1

if a==1 and b==1:
  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:

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

Submission status: Accepted

Solution code:
S = str(input())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
S = 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]:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys,math,copy,queue,itertools
from fractions import gcd
sys.setrecursionlimit(10**7)
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
_LI = lambda : [int(x)-1 for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
INF = 10**18
MOD = 10**9 + 7
DD = ((1,0),(0,1),(-1,0),(0,-1))
s = sys.stdin.readline()

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

Submission status: Accepted

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

import sys


def input():
    return sys.stdin.readline()


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

S_list = list(S)

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

Submission status: Accepted

Solution code:
# import numpy as np
# import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)


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

    res = 'Yes'

    if S[2] != S[3]:
        res = 'No'

    if S[4] != S[5]:
        res = 'No'

    print(res)



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

Submission status: Accepted

Solution code:
input_str = input()

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

Submission status: Accepted

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