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:
# coding: utf-8

# 標準入力<str>
S = input()

ans = "Yes"

if S[2] != S[3]:
  ans = "No"

if S[4] != S[5]:
  ans = "No"

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()


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

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

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

if S3 == S4 and S5 == S6:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def main():
  #n = int(input())
  s = list(input())
  #s = input().split()
  #a,b = list(map(int,input().split()))
  #a = [input() for i in range(n)]
  #a = [int(input()) for i in range(n)]
  #a = [input().split() for i in range(n)]
  #a = [list(map(int,input().split())) for i in range(n)]
  ans = 0
  count = 0
  lis = []
  
  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:
#!/usr/bin/env python3
s = 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] 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())
c = 0
if s[2] == s[3] and s[4] == s[5]:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
from collections import defaultdict, deque
import sys
import heapq
import bisect
import math
import itertools
import string
import queue
import copy
import time
from fractions import gcd

sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7

def inp(): return int(sys.stdin.readline())
 
def inp_list(): return list(map(int, sys.stdin.readline().split()))

def lcm(x, y): return (x * y) // gcd(x, y)


from collections import defaultdict, deque
import sys
import heapq
import bisect
import math
import itertools
import string
import queue
import copy
import time
from fractions import gcd

sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7

def inp(): return int(sys.stdin.readline())
 
def inp_list(): return list(map(int, sys.stdin.readline().split()))

def lcm(x, y): return (x * y) // gcd(x, y)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
p = str(input())
if p[2] == p[3] and p[4] == p[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:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1

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


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


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


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(S):
    if S[2] != S[3]:
        return 'No'

    if S[4] != S[5]:
        return 'No'
    return 'Yes'


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())
S = list(S)

hantei = list('coffee')
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();print('YNeos'[c!=d or e!=f::2])

Submission status: Accepted

Solution code:
def inpl():
    return list(map(int, input().split()))


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

  s_line = list(S)

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

if __name__ == "__main__":
  main()

Submission status: Accepted

Solution code:
import sys
import numpy as np

from collections import deque 
from functools import reduce

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(input())
ans = "Yes"

if a[2] != a[3]:
  ans = "No"

if a[4] != a[5]:
  ans = "No"
  
print(ans)

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,math
sys.setrecursionlimit(10**9)
from collections import defaultdict
 
IA = lambda: map(int,input().split())
IAS= lambda: map(str,input().split())


s=input()

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

Submission status: Accepted

Solution code:
list_a = list(input())

if list_a[2] == list_a[3]:
  if list_a[4] == list_a[5]:
    print('Yes')
  else:
    print('No')
    
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:
#!/usr/bin/env python3

import sys


def LI():
    return list(map(int, sys.stdin.buffer.readline().split()))


def I():
    return int(sys.stdin.buffer.readline())


def LS():
    return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()


def S():
    return sys.stdin.buffer.readline().rstrip().decode('utf-8')


def IR(n):
    return [I() for i in range(n)]


def LIR(n):
    return [LI() for i in range(n)]


def SR(n):
    return [S() for i in range(n)]


def LSR(n):
    return [LS() for i in range(n)]


def SRL(n):
    return [list(S()) for i in range(n)]


def MSRL(n):
    return [[int(j) for j in list(S())] for i in range(n)]

# ----------------------------------------------------------------


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

s = input()
res = 'Yes' if isCoffee(s) else 'No'
print(res)

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def main():
    s = input()
    if len(s) == 6 and s[2] == s[3] and s[4] == s[5]:
        print('Yes')
    else:
        print('No')

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#!python3

iim = lambda: map(int, input().rstrip().split())

def resolve():
    s = input()

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

if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
l = list(input())

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

Submission status: Accepted

Solution code:
s = input()		# 文字列の入力  abcdefg...

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

Submission status: Accepted

Solution code:
# import sys
# import math #sqrt
# import decimal
# import queue # queue
# import bisect
# import heapq # priolity-queue
# import time
# import itertools
# import collections # deque
# from operator import itemgetter
# from fractions import Fraction

mod = int(1e9+7)
INF = 1<<29
lINF = 1<<35

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

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

Submission status: Accepted

Solution code:
def resolve():
    S_list = list(input())

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

if __name__ == "__main__":
    resolve()

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

    S = input().rstrip('\n')

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

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

Submission status: Accepted

Solution code:
S = input()
N = len(S)
if N != 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()

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()
def calculate(s):
    if s[2] == s[3]:
        if s[4] == s[5]:
            print("Yes")
            return

    print("No")
calculate(S)

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

Solution code:
from sys import stdin


# A, B = [int(x) for x in stdin.readline().rstrip().split()]
# A,B = [int(x) for x in stdin.readline().rstrip().split()]
U = stdin.readline().rstrip().split()
# print(U[0][1])
if U[0][2]==U[0][3] and U[0][4]==U[0][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


def get_result(data):
    S = data[0]
    if S[2] == S[3] and S[4] == S[5]:
       return 'Yes'
    return 'No'


if __name__ == '__main__':
    data = list(map(str, stdin.readline().rstrip('\n').split(' ')))
    result = get_result(data)
    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:
s = list(input())
# a = list(map(int, input().split(" ")))

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

Submission status: Accepted

Solution code:
S=str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()

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

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
import sys 
import math
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())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

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

Submission status: Accepted

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


##########
if __name__ == "__main__":
    a()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
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:
a = input()
l = list(a)
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]:
    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:
import sys

s = sys.stdin.readline().strip()
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=input()
if S[2]==S[3]:
    if S[4]==S[5]:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Submission status: Accepted

Solution code:
s = str(input())

res = True

if s[2] != s[3]:
    res = False

if s[4] != s[5]:
    res = False

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# li = [[0] * 4 for i in range(3)]

# A = 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:
# -*- 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 collections
import sys
input = sys.stdin.readline

#n = int(input())
#l = list(map(int, input().split()))

'''
A=[]
B=[]
for i in range():
    a, b = map(int, input().split())
    A.append(a)
    B.append(b)'''
#import copy
#import numpy as np

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

Submission status: Accepted

Solution code:
s = str(input())

ans = 'No'

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S=input()

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

Submission status: Accepted

Solution code:
import sys, re
import math
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

# -*- 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=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

a=input()

if a[2]==a[3]:
    if a[4]==a[5]:
        print("Yes")
        sys.exit()

print("No")

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# input
S = input()

# output
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:
# -*- 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 = str(input())
if a[2] == a[3] and a[4] == a[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:
s = input()
#n,x = map(int,input().split())
#L = list(map(int,input().split()))
if s[2]==s[3] and s[4]==s[5]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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('YNeos'[not(s[2]==s[3] and s[4]==s[5])::2])

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def solve():
    N = input()
    if N[2:3] == N[3:4] and N[4:5] == N[5:6]:
        print("Yes")
    else:
        print("No")


# Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def a160(s):

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

    return ans

def main():
    s = str(input())
    print(a160(s))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
"""def power(x, y): 
    res = 1
    x=x
    while (y > 0): 
        if ((y & 1) == 1) : 
            res = (res * x) 
        y = y >> 1
        x = (x * x)
    return res""" 
"""def fact(n):
    if(n==0):
        return 1
    if(n==1):
        return 1
    return fact(n-1)+fact(n-2)"""

import math
#import combinations

#t=int(input())
#for _ in range(t):
#n=int(input())
s=input()
#arr=list(map(int,input().split()))
#n,k=map(int,input().split())
#count=0
#arr=list(map(int,input().split()))
if(s[2]==s[3] and s[4]==s[5]):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
# coding: utf-8

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str = input()
char_list = list(str)#文字列をリストに

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

Submission status: Accepted

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

    return len(S) >= 6 and (S[2] == S[3]) and (S[4] == S[5])

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

Submission status: Accepted

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


def main():
    s = input()
    res = solve(s)
    print(res)


def test():
    assert solve("sippuu") == "Yes"
    assert solve("iphone") == "No"
    assert solve("coffee") == "Yes"


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

Submission status: Accepted

Solution code:
#n=int(input())
#a,b=map(int,input().split())
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]

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')
    else:
        print('No')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
S = input().strip()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#gcdは3.4.3だとfractionsにある
from fractions import gcd
import math

from math import factorial as f

from math import ceil,floor,sqrt


import bisect
import re
import heapq


from copy import deepcopy
import itertools

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

yes = "Yes"
no = "No"

def main():
    s = input()
    if not s[2] == s[3]:
        print(no)
        exit()
    if not s[4] == s[5]:
        print(no)
        exit()
    print(yes)




main()

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:
# t=int(input())
# for _ in range(t):
#     m,n=tuple(map(int,input().split(" ")))
#     if(m<6):
#         print("NO")
#     elif(m%n==0):
#         print("YES")
#     else:
#         print("NO")
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] 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')