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

Submission status: Accepted

Solution code:
S =input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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=str(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 = 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:
"""
import random
import functools
import copy
import bisect
import array
import re
import collections
import heapq
import fractions
import itertools
import string
import math
from operator import itemgetter as ig
from bisect import bisect_left, bisect_right, insort_left, insort_right
from itertools import permutations, combinations, product, accumulate, groupby
from heapq import heappush, heappop
from collections import deque, defaultdict, Counter
import sys
sys.setrecursionlimit(10 ** 7)
# import numpy as np

inf = 10 ** 20
INF = float("INF")
mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = dd + [(-1, 1), (1, 1), (1, -1), (-1, -1)]
ddn9 = ddn + [(0, 0)]
'''for dx, dy in dd:
        nx = j + dx; ny = i + dy
            if 0 <= nx < w and 0 <= ny < h:'''
"""
from collections import deque, defaultdict, Counter
import math
import sys
sys.setrecursionlimit(10 ** 7)


def wi(): return list(map(int, sys.stdin.readline().split()))
# WideIntPoint


def wip(): return [int(x) - 1 for x in sys.stdin.readline().split()]


def ws(): return sys.stdin.readline().split()


def si(): return int(sys.stdin.readline())  # SingleInt


def ss(): return input()


def hi(n): return [si() for _ in range(n)]


def hs(n): return [ss() for _ in range(n)]  # HeightString


def s_list(): return list(input())


def mi(n): return [wi() for _ in range(n)]  # MatrixInt


def mip(n): return [wip() for _ in range(n)]


def ms(n): return [ws() for _ in range(n)]


def num_grid(n): return [[int(i) for i in sys.stdin.readline().split()[
    0]] for _ in range(n)]  # NumberGrid


def grid(n): return [s_list() for _ in range(n)]


def gcd(a, b):
    while b:
        a, b = b, a % b
    return a


def lcm(a, b):
    """a,bの最小公倍数"""
    return a * b // gcd(a, b)


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:
str1 = str(input())
 
if str1[2] == str1[3] and str1[4] == str1[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:
#!/usr/bin/env python
import sys
from collections import Counter
from itertools import permutations, combinations
from fractions import gcd
from math import ceil, floor
import bisect
sys.setrecursionlimit(10 ** 6)
inf = float("inf")

def input():
    return sys.stdin.readline()[:-1]

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

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


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=list(input())
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 ** 7)
rl = sys.stdin.readline


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


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


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:
import sys
input = sys.stdin.readline
'''
n, m = map(int, input().split())
n = int(input())
A = list(map(int, input().split()))
for test in range(int(input())):
'''
inf = 100000000000000000  # 1e17

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

Submission status: Accepted

Solution code:
# solution

data=input()

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

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

else:
    print('No')

Submission status: Accepted

Solution code:
import numpy as np


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


s = str(input())
solve()
#a = [int(i) for i in input().split(" ")]

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:

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

Submission status: Accepted

Solution code:
#文字列をリストに変換
list_coffee = list(input())

#判別
if list_coffee[2] == list_coffee[3] and list_coffee[4] == list_coffee[5]:
  text = "Yes"
else:
  text = "No"

#結果の表示
print(text)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s_list = input()
#print(s_list)

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

Submission status: Accepted

Solution code:
str1 = str(input())

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

Submission status: Accepted

Solution code:
S = list(input())
print('YNeos'[S[2::2]!=S[3::2]::2])

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

Submission status: Accepted

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

sign = 1
if (s[2] == s[3]) and (s[4] == s[5]):
  sign = 0
  
if sign == 0:
  ans = 'Yes'
elif sign == 1:
  ans = 'No'
  
print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
b = list(a)
if b[2] == b[3] and b[4] == b[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")
    quit()
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:
S = input()
S1 = S[2:4]
S2 = S[4:6]
if ((S1[0]==S1[1]) and (S2[0]==S2[1])):
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
#!pypy3
import sys
from collections import *
import heapq
import math
import bisect
from itertools import permutations,accumulate,combinations,product
from fractions import gcd
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]

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 pypy3
import sys
from collections import *
import heapq
import math
import bisect
from itertools import permutations,accumulate,combinations,product
from fractions import gcd
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]

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

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


if __name__ == "__main__":
    _in = [_.rstrip() for _ in stdin.readlines()]
    S =     _in[0]   # type:str
    # vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
    TF = 'Yes' if S[2]==S[3] and S[4]==S[5] else 'No'
    # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
    print(TF)

Submission status: Accepted

Solution code:
inp = input()
print('Yes' if inp[2] == inp[3] and inp[4] == inp[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:
input_string = input()

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

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 = 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:
# coding: utf-8
# Your code here!

S = input()

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
s = list(input())
ans = "No"
if s[2] == s[3] and s[4] == s[5]:
    ans = "Yes"
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

#ライブラリインポート
from collections import defaultdict

con = 10 ** 9 + 7
#入力受け取り
def getlist():
	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()
ret = 'No'
if S[2] == S[3]:
    if S[4] == S[5]:
        ret = 'Yes'
print(ret)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(map(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:
#!/usr/bin/env python3
_, _, c, d, e, f = input()
print(c == d and e == f and 'Yes' or '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:
temp = input()

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

Submission status: Accepted

Solution code:

url = "https://atcoder.jp//contests/abc160/tasks/abc160_a"

def main():
    text = input()
    if text[2] == text[3]:
        if text[4] == text[5]:
            print('Yes')
            exit()
    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:
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:
n = list(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=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:
# -*- coding: utf-8 -*-
a=input()
if a[2] == a[3] and a[4] == a[5]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

def main():
    *N, = map(str, open(0).read().split())
    if N[0][2] == N[0][3] and N[0][4] == N[0][5]:
        print('Yes')
    else:
        print('No')


main()

Submission status: Accepted

Solution code:
import os

def main():
	s = input()
	seikai = 0
	s = list(s)
	for i,v in enumerate(s):
		if i == 2 or i == 4:
			if s[i] == s[i+1]:
				seikai += 1
	
	if seikai == 2:
		print("Yes")
	else:
		print("No")
			

if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
word = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()
print(["No", "Yes"][x[2] == x[3] and x[4] == x[5]])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(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()
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", "No"][not (s[2] == s[3] and s[4] == s[5])])


if __name__ == "__main__":
    main()

Submission status: Accepted

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

import sys
import math

sys.setrecursionlimit(10 ** 6)

input_line = input()
s = list(input_line)

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

Submission status: Accepted

Solution code:
S = input()

A = S[3-1]
B = S[4-1]
C = S[5-1]
D = S[6-1]

if A == B and C == D:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
tmp = input()
S = [0]*6
for i in range(6):
  S[i] = tmp[i]
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[5]==s[4]:
	print('Yes')
else:
	print('No')

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

Submission status: Accepted

Solution code:
text = input()

if (text[2] == text[3]) & (text[4] == text[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, 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\n")
else:
    print("No\n")

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=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:
# coding: utf-8
DATA = """
sippuu
""".split("\n")

def get_debug_line():
	for i in DATA:
		yield i

if 1:
	get_line = input
else:
	get_line = get_debug_line().__next__
	get_line()

N = get_line()

if N[2] == N[3] and N[4] == N[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:
import sys
input = lambda: sys.stdin.readline().rstrip()
input_nums = lambda: 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[2]==s[3] and s[4]== s[5]:
	print('Yes')
else:
	print('No')

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

S = input()

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

Submission status: Accepted

Solution code:
def main():

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
INF = float("inf")


def yes():
    print("Yes")  # type: str


def no():
    print("No")  # type: str


def solve(S: str):
    if S[2] == S[3] and S[4] == S[5]:
        yes()
    else:
        no()
    return


def main():

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
s = input()

s_list = [i for i in s]

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

S=list(stdin.readline().strip())
if S[3]==S[2] and S[4]==S[5]:print("Yes")
else:print("No")

Submission status: Accepted

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

s = input()
f(s)

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
S=str(input())

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

Submission status: Accepted

Solution code:
a = input()
if a[2] == a[3] and a[4] == a[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=""
while len(s)!=6:
    s=input()

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