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

Submission status: Accepted

Solution code:
a = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d,e,f=input()
if c==d and e==f:
    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()
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]):
    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")
elif True:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():

    a = stdin.readline().rstrip()
    
    if a[2] == a[3] and a[4] == a[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:
a, b, c, d, e, f = input()
if c == d and e == f:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

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

Submission status: Accepted

Solution code:
S = input()

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

print(answer)

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

N = input()

if N[2]==N[3]:
    if N[4]==N[5]:
        print("Yes")
        sys.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 = input()
print("YNeos"[not(S[4]==S[5] and S[2]==S[3])::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:
x = input()
if (x[2] == x[3]) & (x[4] == x[5]):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()
list= list(x)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())

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

Submission status: Accepted

Solution code:
s = input()

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

print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def like_coffee(s):
	if s[2] == s[3] and s[4] == s[5]:
		return True
	else:
		return False


if like_coffee(input()):
	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:
# 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:
def coffee(s):
  if len(s) < 6:
    return False
  if s[2] == s[3] and s[4] == s[5]:
    return 'Yes'
  else:
    return 'No'

string = input()
print(coffee(string))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
count = 0
a1 = 1
for i in S:
  if count == 2 or count == 4:
    mem = i
  if count == 3 or count == 5:
    if mem == i:
      a1 *= 1
    else:
      a1 *= 0
      
  count += 1
  
  
if a1==1:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
a=[]
for j in s:
    a.append(j)
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:
coffee = input()
print("Yes") if coffee[2] == coffee[3] and coffee[4] == coffee[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:
txt = input()

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

Submission status: Accepted

Solution code:
chrs = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

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

Submission status: Accepted

Solution code:
S = input()

A = list(S)

#print(A)

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()
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:
a = 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 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 = [ c for c in 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
# sys.setrecursionlimit(10 ** 6)
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 LLI(rows_number): return [LI() for _ in range(rows_number)]


def solve():
    s = input()
    print('Yes' if s[2]==s[3] and s[4]==s[5] else '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,b,c,d,e,f = input()

if c == d and e == f :
    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()
a = list(s)
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[5]==S[4]:
    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:
string=input()
print("Yes" if string[2]==string[3] and string[4]==string[5] else "No")

Submission status: Accepted

Solution code:
#A

S = input()

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

Submission status: Accepted

Solution code:
from sys import stdin
import math
import fractions

s = stdin.readline().rstrip()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
stR = input()
rsp = ('No', 'Yes')[len(stR) == 6 and stR[2] == stR[3] and stR[5] == stR[4]]
print(rsp)

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')
    exit(0)
print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu Mar 19 11:55:12 2020

@author: 17664
"""
coffee = input()

ans = 'Yes'

if coffee[2] != coffee[3]:
    ans = 'No'
if coffee[4] != coffee[5]:
    ans = 'No'
    
print(ans)

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

Submission status: Accepted

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    s = str(readline().rstrip().decode('utf-8'))
    if s[2] == s[3] and s[4] == s[5]:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
a = list(input().strip())

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

Submission status: Accepted

Solution code:
s = input()
X = s[2]==s[3] and s[4]==s[5]
if X : 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 -*-

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:
str = input()
if str[2]==str[3] and str[4]==str[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 = 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())
def check(s):
    if s[2]!=s[3]:
        return "No"
    else:
        if s[4]!=s[5]:
            return 'No'
        else:
            return 'Yes'

print(check(s))

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc160/tasks/abc160_a
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]) & (a[4] == a[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:
S = input()
if S[2] == S[3] and S[4]==S[5]:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
message = input()

temp_list=list(message)


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

Submission status: Accepted

Solution code:
args = input()

S = list(args)

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:
words = list(input())
if words[2] == words[3] and words[4]== words[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 = 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:
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:
from sys import exit, stdin
S = stdin.readline().rstrip()
if S[2] == S[3] and S[4] == S[5]:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
def JudgeCoffee(string):
    if(string[2] == string[3] and string[4] == string[5]):
        return True
    else:
        return False


def Main():
    S = input()
    #S = "sippuu"
    judge = JudgeCoffee(S)
    if(judge):
        print("Yes")
    else:
        print("No")
    

Main()

Submission status: Accepted

Solution code:
first_input = input().split(" ")

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s = input();

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
s.lower()

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

Submission status: Accepted

Solution code:
input_line = input()
buffer = ""
flag = False
for i, s in enumerate(input_line):
    if (i == 2 or i == 4):
        buffer = s
    elif (i == 3 or i == 5):
        if (buffer != s):
            break
        elif (i == 5 and buffer == s):
            flag = True

if (flag):
    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()
b = list(a)
if b[2] == b[3] and b[4] == b[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 = 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:
from sys import stdin

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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
from collections import deque
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 = 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()
if str[2] == str[3] and str[4] == str[5]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

MOD = 10**9
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)
    return divisors

S = 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,random,time

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

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

Submission status: Accepted

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

if coffee[2] == coffee[3] and coffee[4] == coffee[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 len(set(S[2:4]))==1 and len(set(S[4:]))==1:
    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")
    exit()
print("No")

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
# coding: utf-8
import sys
sys.setrecursionlimit(10000000)

#const
dxdy=((1,0),(0,1))
# my functions here!
def pin(type=int):
    return map(type,input().rstrip().split())

def resolve():
    s=input()
    cond= s[2]==s[3] and s[4]==s[5]
    print(["No","Yes"][cond])
"""         
#printデバッグ消した？
#前の問題の結果見てないのに次の問題に行くの？
"""
"""
お前カッコ閉じ,るの忘れてるだろ
"""
import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """sippuu"""
        output = """Yes"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """iphone"""
        output = """No"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """coffee"""
        output = """Yes"""
        self.assertIO(input, output)


if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
ans="No"
if s[2]==s[3] and s[-2]==s[-1]:
    ans="Yes"
print(ans)

Submission status: Accepted

Solution code:
str = input().rstrip()                      
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:
S = input()
if S[2] != S[3] or S[4] != S[5]:
  print("No")
else:
  print("Yes")

Submission status: Accepted

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

YES = "Yes"  # type: str
NO = "No"  # type: str


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


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str

    solve(S)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def islikecoffee(s):
    return s[2] == s[3] and s[4] == s[5]

def test():
    ans = islikecoffee('coffee'), islikecoffee('abccdd'), islikecoffee('abccds')
    print(ans)

print('Yes' if islikecoffee(input()) else 'No')

Submission status: Accepted

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


main()

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c, d, e, f = map(str, input())
S = a + b + c + d + e + f

if c == d:
    if e == f:
        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:
str = input()

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

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

Submission status: Accepted

Solution code:
cf = str(input())

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