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:
#!/usr/bin/env python3
import sys
import collections as cl


def II(): return int(sys.stdin.readline())


def MI(): return map(int, sys.stdin.readline().split())


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


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


main()

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

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

Submission status: Accepted

Solution code:
#Macで実行する時
import sys
import os
if sys.platform=="darwin":
	base = os.path.dirname(os.path.abspath(__file__))
	name = os.path.normpath(os.path.join(base, '../atcoder/input.txt'))
	sys.stdin = open(name)

s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

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


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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    S = readline().strip()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
if s[2] == s[3] 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:
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline

s = input().rstrip()

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')
elif A[2] != A[3] or A[4] != A[5]:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
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] and x[4] == x[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]:
  if S[4] == S[5]:
    ans = "Yes"
print(ans)

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


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
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
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

if __name__ == "__main__":
  resolve()

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

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

Submission status: Accepted

Solution code:
S = input()

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

else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
def gcd(*numbers): reduce(math.gcd, numbers)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
ans = 0

S = X()

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

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S  = input()

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
from sys import exit
S = input()

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

print('No')

Submission status: Accepted

Solution code:
S=input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(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.split()

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

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

Submission status: Accepted

Solution code:
s = input()
s_list = list(s)
if s_list[2] == s_list[3] and s_list[4] == s_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:
# -*- coding: utf-8 -*-

# Stringを配列として使う

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

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

Submission status: Accepted

Solution code:
#

import sys
input=sys.stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
S = readline().decode().rstrip()
if S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import itertools
import functools
import math
from collections import Counter

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:
#python 2.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]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


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


def main():
    print(solve())


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = str(input().split())
b = list(a)
if b[4] == b[5] and b[7] == b[6]:
     print("Yes")
else :
     print("No")

Submission status: Accepted

Solution code:
a = str(input().split())
s = list(a)
if s[4] == s[5] and s[7] == s[6]:
      print("Yes")
else :
      print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
string = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
 
if s[2] == s[3] 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:
# 159 A

s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())
print('Yes' if S[2]==S[3] and S[4]==S[5] else '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:
import sys
from collections import deque
import numpy as np
import math
sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().split())

def Main():
    s = S()
    if len(s)<6:
        print('No')
        exit()
    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!=' ':
    print("Yes") if s[3]==s[2] and s[4]==s[5] 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("YNeos"[not (s[2]==s[3] and s[4]==s[5])::2])

Submission status: Accepted

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

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

a=s[2]
b=s[3]
c=s[4]
d=s[5]

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())

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

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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 S[2]==S[3] and S[4]==S[5]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


S = input()

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

Submission status: Accepted

Solution code:
def resolve():
    S = str(input())
    if S[3 - 1] == S[4 - 1] and S[5 - 1] == S[6 - 1]:
        print('Yes')
        return
    print('No')
    return

resolve()

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

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

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
from math import floor
from decimal import Decimal

S = input()

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

Submission status: Accepted

Solution code:
t = input()
if t[2]==t[3]:   
    if t[4]==t[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 = 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')
    exit()
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()

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys 

inp=sys.stdin.readline()


def coffeeLike(inp):
	
	li=list(inp)
	if(len(li)>=6):
		if (li[2]==li[3]) and (li[4]==li[5]):
			print("Yes")
		else:
			print("No")
	else:
		print("No")
		
	
coffeeLike(inp)

Submission status: Accepted

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

a = resolve()

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

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = lambda: sys.stdin.readline().rstrip()


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


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 入力値を受け取る
s = input()

# 入力値の3文字目を受け取る
a = s[2]

# 入力値の4文字目を受け取る
b = s[3]

# 入力値の3文字目と4文字目が同じでないなら'No'を表示する
if a != b:
    print('No')
    exit()
    
# 入力値の5文字目を受け取る
c = s[4]

# 入力値の6文字目を受け取る
d = s[5]

# 入力値の5文字目と6文字目が同じでないなら'No'を表示する
if c != d:
    print('No')
    exit()

# 上記以外なら'Yes'を表示する
print("Yes")

Submission status: Accepted

Solution code:
S=input()

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

Submission status: Accepted

Solution code:
s = input()
if s[-1] == s[-2]:
  if s[-3] == s[-4]:
    print("Yes")
    exit()

print("No")

Submission status: Accepted

Solution code:
s = input()

s1, s2, s3, s4, s5, s6 = s

if s3 == s4 and s5 == s6:
	print('Yes')
else:
	print('No')

Submission status: Accepted

Solution code:
s = input()
# 入力したsの3文字目つまりリストの3-1が4-1と一緒
# 同様に5-1と6-1が一緒ならyes
if s[2] == s[3] and s[4] == s[5]:
  print('Yes')
else: print('No')

Submission status: Accepted

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

Submission status: Accepted

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