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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#! env/bin/local 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:
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:
sentence = input()

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

Submission status: Accepted

Solution code:
s = [i for i in 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:
#!/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


def main():
    s = sys.stdin.readline().strip()  # type: str
    solve(s)


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:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

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

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    s = S()
    if s[2] == s[3] and s[4] == s[5]:
        return 'Yes'

    return "No"


print(main())

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
import sys
def I(): return int(input())  # '123' -> 123
def Is(): return map(int, input().split())  # '123 456' -> 123, 456
def LI(): return list(map(int, input().split()))  # '123 456' -> [123, 456]
def TI(): return tuple(map(int, input().split()))  # '123 456' -> (123, 456)
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()  # 'aa bb' -> 'aa','bb' or ['aa','bb']
def LS(): return list(input())  # 'abc123' -> ['a','b','c','1','2','3']
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(1000000)
MOD = 1000000007
INF = float('inf')

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 6)
# input = sys.stdin.readline    ####
int1 = lambda x: int(x) - 1
def II(): return int(input())

def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())

def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

INF = float('inf')

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
s = readline()

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

Submission status: Accepted

Solution code:
import sys
s = input()

if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
    sys.exit()
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()
f="No"
if s[2]==s[3] and s[4]==s[5]:
    f="Yes"
if len(s)!=6:
    f="No"
print(f)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()

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

Submission status: Accepted

Solution code:
S = input()

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()
count = 0
if S[2] == S[3]:
    count+=1
if S[4] == S[5]:
    count+=1
if count == 2:
    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:
# A - Coffee

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

Submission status: Accepted

Solution code:
S=input()

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6) #再帰関数の上限
import math
from copy import copy, deepcopy
from operator import itemgetter

from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque 
#deque(l), pop(), append(x), popleft(), appendleft(x)
##listでqueの代用をするとO(N)の計算量がかかってしまうので注意
#dequeを使うときはpython3を使う、pypyはダメ
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone

def input(): return sys.stdin.readline()[:-1]
def printl(li): print(*li, sep="\n")
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds

#mod = 10**9+7
#w.sort(key=itemgetter(1),reversed=True)  #二個目の要素で降順並び替え

#N = int(input())
#N, K = map(int, input().split())
#L = [int(input()) for i in range(N)]
#A = list(map(int, input().split()))
#S = [list(map(int, input().split())) for i in range(N)]

S=input()

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

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

S = str(input())

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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 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"+"\n")
else:
  print("No"+"\n")

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
S = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


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


if __name__ == '__main__':
    print(solve())

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

Submission status: Accepted

Solution code:
s=list(input())

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

Submission status: Accepted

Solution code:
#-*- coding: utf-8 -*-
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:
str1 = str(input())

if len(str1) != 6 :
     print('No')

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

Submission status: Accepted

Solution code:
word=input().rstrip()
flag=0
if word[2]==word[3]:
    if word[4]==word[5]:
        flag=1
if flag:
    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:
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)


def main():
    S = input().strip()
    if len(S) != 6:
        return "No"
    if S[2] == S[3] and S[4] == S[5]:
        return "Yes"
    else:
        return "No"


if __name__ == "__main__":
    print(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:
data = input()

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

Submission status: Accepted

Solution code:
S = str(input())

L = list(S)

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

else:
    print("No")

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

s = input()

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

Submission status: Accepted

Solution code:
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[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:
from sys import stdin

s = stdin.readline().rstrip()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = raw_input()#,k = map(int, raw_input().split(' '))
print 'Yes ' if len(s) >= 6 and s[2] == s[3] and s[4] == s[5] else 'No' #f(n,k)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()

#coffee

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

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

Submission status: Accepted

Solution code:
S = input()
is_flag = True
if S[2] != S[3]:
    is_flag = False
if S[4] != S[5]:
    is_flag = False
if is_flag == True:
    print("Yes")
elif is_flag == False:
    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:
l = input()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Tue Apr 28 21:57:22 2020
"""

import sys
#import numpy as np

sys.setrecursionlimit(10 ** 9)
#def input():
#    return sys.stdin.readline()[:-1]
mod = 10**9+7

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

S = input()
cond = (S[2]==S[3]) & (S[4]==S[5])

ans = "Yes" if cond else "No"
print(ans)

Submission status: Accepted

Solution code:
s= list(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# input
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:
import sys;input=lambda:sys.stdin.readline().rstrip();aint=lambda:int(input());ints=lambda:list(map(int,input().split()))
import math;floor,ceil=math.floor,math.ceil
from collections import deque
Yes=lambda b:print('Yes')if b else print('No');YES=lambda b:print('YES')if b else print('NO')
is_even=lambda x:True if x%2==0 else False

def main():
    s = input()
    Yes(s[2]==s[3]and s[4]==s[5])

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

m = list(n)

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

def main():
  s = input()

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

main()

Submission status: Accepted

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

def check(i, j):
    if S[i] == S[j]:
        return True
    return False

if check(2,3) and check(4,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:
def solve(s):
    return s[2] == s[3] and s[4] == s[5]


if __name__ == "__main__":
    print("Yes" if solve(input()) else "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()

# import sys
# input = sys.stdin.readline
# 
# sys.setrecursionlimit(10 ** 7)
# 
# (int(x)-1 for x in input().split())
# rstrip()
#
# def binary_search(*, ok, ng, func):
#     while abs(ok - ng) > 1:
#         mid = (ok + ng) // 2
#         if func(mid):
#             ok = mid
#         else:
#             ng = mid
#     return ok

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

s = inputS()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
print('YNeos'[(s[2]!=s[3])|(s[4]!=s[5])::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_tuple(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_col(H):
    '''
    H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) #一列の場合
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_matrix(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


MOD = 10**9 + 7
INF = 2**31  # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  # , insort_left, insort_right
# https://atcoder.jp/contests/abc160/tasks/abc160_a

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

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from heapq import heapify, heappop, heappush
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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:
from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def main():
    s = input()
    if s[2] == s[3] and s[4] == s[5]:
        print('Yes')
    else:
        print('No')
if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
sl = list(input())

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

Submission status: Accepted

Solution code:
S = input()

third = S[2]
fourth = S[3]
fifth = S[4]
sixth = S[5]

print('Yes') if third == fourth and fifth == sixth 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")