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

Submission status: Accepted

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

c = input()
p = '^.{2}(.)\\1(.)\\2$'
print('Yes' if re.match(p, c) else 'No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
li  = list(input())

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

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

s=list(S)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC160A
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] and s[4] == s[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:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
S = input()

check = S[2] == S[3] and S[4] == S[5]

print("Yes" if check 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 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:
from sys import stdin
import math
inp = lambda : stdin.readline().strip()

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

Submission status: Accepted

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

if s[0] != s[1] 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:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a= input()

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

else: print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

if s[2] is s[3]:
    if s[4] is 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:
O = ['No','Yes']
S = str(input())
f = 0

if S[2] == S[3] and S[4] == S[5]:
    f = 1

print(O[f])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = 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[2]==s[3] and s[4]==s[5]
      else "No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip.split())
def main():
    s = S()
    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] and S[4] == S[5]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

if '__main__' == __name__:
    resolve()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
answer = input()

count = 0
list = []
for i in answer:
    list.append(i)

if len(answer) != 6:
    print("No")

elif 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()
ans = []

for p in range(len(s)):
  ans.append(s[p])
if ans[2] == ans[3] and ans[4] == ans[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:
a = input()
if a[2]==a[3] and a[4]==a[5]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
ins = lambda: input().rstrip()
ini = lambda: int(input().rstrip())
inm = lambda: map(int, input().split())
inl = lambda: list(map(int, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
# Coffee
S = list(input())
ans = ['No', 'Yes'][(S[2] == S[3]) & (S[4] == S[5])]
print(ans)

Submission status: Accepted

Solution code:
w = str(input())
s = []
for k in(list(w)):
    s.append(k)
if s[2] == s[3]:
    if s[4] == s[5]:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()
flg = False
if s[2] == s[3] and s[4] == s[5]:
    flg = True

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

Submission status: Accepted

Solution code:
s = input()
flg = False
if s[2] == s[3] and s[4] == s[5]:
    flg = True

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- 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, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

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

print(ans)

Submission status: Accepted

Solution code:
s = f"@{input()}"
print((s[3] == s[4] and s[5] == s[6]) and "Yes" or "No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():

    S = input()
    listS = list(S)

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

    else:
        ans = 'No'

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
s = sys.stdin.read()
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:
a = list(str(input()))
if(a[2] == a[3] and a[4] == a[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()
ans = "No"

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str = input()

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

Submission status: Accepted

Solution code:
s =input()

if (s[2] == s[3]) & (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:
# abc160_a.py
# https://atcoder.jp/contests/abc160/tasks/abc160_a

# A - Coffee /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点 : 100点

# 問題文
# ある長さ 6の英小文字からなる文字列がcoffeeに似ているとは、3 文字目と 4 文字目が等しく、
# 5 文字目と 6 文字目も等しいことを言います。
# 与えられる文字列 Sがcoffeeに似ているか判定してください。

# 制約
#     Sは長さ 6の英小文字からなる文字列である。

# 入力
# 入力は以下の形式で標準入力から与えられる。
# S

# 出力
# Sがcoffeeに似ている場合 Yes を、そうでない場合 Noを出力せよ。

# 入力例 1
# sippuu

# 出力例 1
# Yes

# sippuu は 3文字目と 4 文字目が等しく、5 文字目と 6文字目も等しいです。

# 入力例 2
# iphone

# 出力例 2
# No

# 入力例 3
# coffee

# 出力例 3
# Yes


global FLAG_LOG
FLAG_LOG = False


def log(value):
    # FLAG_LOG = True
    # FLAG_LOG = False
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    S = lines[0]
    # N = int(lines[0])
    # N, M = list(map(int, lines[0].split()))
    # values = list(map(int, lines[1].split()))
    # values = list(map(int, lines[2].split()))
    # values = list()
    # for i in range(N):
    #     values.append(int(lines[i]))
    # valueses = list()
    # for i in range(N):
    #     valueses.append(list(map(int, lines[i+1].split())))

    result = 'Yes'
    if S[2] != S[3]:
        result = 'No'
    elif S[4] != S[5]:
        result = 'No'

    return [result]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['sippuu']
        lines_export = ['Yes']
    if pattern == 2:
        lines_input = ['iphone']
        lines_export = ['No']
    if pattern == 3:
        lines_input = ['coffee']
        lines_export = ['Yes']
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#l = 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:
#!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import collections
import functools
import itertools
import math
import sys

INF = float('inf')
YES = "Yes"  # type: str
NO = "No"  # type: str


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


def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    print(f'{solve(S)}')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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 math
import sys
readline = sys.stdin.readline


def main():
    s = readline().rstrip()
    print('YNeos'[not(s[2] == s[3] and s[4] == s[5])::2])


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s=str(input())
print("NYoe s"[s[2]==s[3] and s[4]==s[5]::2])

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

Submission status: Accepted

Solution code:
import sys

S = input()
if not ( len(S) == 6 and S.islower() ): sys.exit()
print('Yes') if S[2] == S[3] and S[4] == S[5] 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:
a,b,c,d,e,f = input()
if c == d and e == f:
  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=input();
if s[2]==s[3] and s[4]==s[5]:
	print("Yes")
else : print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()
if N[-4] == N[-3] and N[-2] == N[-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:
# A Coffee

S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input();print('NYoe s'[s[2]==s[3]and s[4]==s[5]::2])

Submission status: Accepted

Solution code:
def similar_coffee():
    # 入力
    S = input()
    # 判別処理
    if S[2] == S[3] and S[4] == S[5]:
        return 'Yes'
    else:
        return 'No'

result = similar_coffee()
print(result)

Submission status: Accepted

Solution code:
import math
import collections
import itertools
import heapq
import sys

def main():
    S = sys.stdin.readline()

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

ans = 'No'

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

print(ans)

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