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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()

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

Submission status: Wrong Answer

Solution code:
S = input()

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

Submission status: Wrong Answer

Solution code:
import sys


def input() -> str:
    return sys.stdin.readline().rstrip("\r\n")


def main():
    s = input()
    if len(s) != 6:
        print('No')
    elif s[-2] == s[-1] and s[2] == s[3]:
        print('Yes')


if __name__ == "__main__":

    main()

Submission status: Wrong Answer

Solution code:
S=input()

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

Submission status: Wrong Answer

Solution code:
x = input()

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

Submission status: Wrong Answer

Solution code:
s = input()
if len(s) != 6:
    print("NO")
    exit()

f = 0
for i in range(len(s)):
    x = ord(s[i])
    if (x < 97) or (x > 122):
        f = 1
        break

if f == 1:
    print("NO")
    exit()

if (s[2] == s[3]) and (s[4] == s[5]):
    print("YES")

else:
    print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=input()

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

Submission status: Wrong Answer

Solution code:
a = list(input())

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

Submission status: Wrong Answer

Solution code:
S = input()

if S[2:] =="ffee":
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

str = input()
strlist = list(str)
print(strlist)

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

Submission status: Wrong Answer

Solution code:
S = input()

if len(S) > 5:
    if S[2:] == 'ffee':
        print('Yes')
    else:
        print('No')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
def main():
    s = input().strip()
    if s[2] == s[3] and s[4] == s[5]:
        print('True')
    else:
        print('False')


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
S = input()

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

Submission status: Wrong Answer

Solution code:
def check(cfe):
    if(cfe[2]!=cfe[3]):
        return "No"
    else:
        if(cfe[4]!=cfe[5]):
            return "No"
        else:
            return "Yes"

def main():
    str = input()

    for i in range(6):
        print(str[i])

    print(check(str))

main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    arg = getInput(input())
    ans = process(arg)
    print(ans)
    
def process(arg):
    cof = list('coffee')
    print(cof)
    print(arg)
    if arg[2] == arg[3] and arg[4] == arg[5]:
        ans = "Yes"
    else:
        ans = "No"

    return ans

def getInput(input):
    # 行数
    n = 1
    # 戻り値
    ret = None

    if n == 1:
        pass
        # ret = input
        ret = list(input)
        # ret = int(input)
        # ret = input.split()
        # ret = list(map(int, input.split()))
        # ret = input.split('T')
    else:
        for x in range(n):
            # 取得したい形式に変換
            ret = input[x]

    return ret

if __name__ == '__main__':
    main()

def getInput2(input):
    # 行数
    n = 2
    # 戻り値
    res = None
    for x in range(n):
        # 取得したい形式に変換
        res = input[x]
    return res

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()
if len(s) != 6:
    print("NO")
else:
    a = [0]*26
    flag = True
    if s[2] != s[3]:
        flag = False
    if s[4] != s[5]:
        flag = False
    if s[3] == s[4]:
        flag = False
    if s[0] == s[1] or s[0] == s[2]:
        flag = False
    if s[0] == s[4] or s[1] == s[2]:
        flag = False
    if s[1] == s[4]:
        flag = False
    if flag:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

Solution code:
input=list(input())
if(input[2]==input[3] and input[4]==input[5]):
  print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
import sys

s = list(sys.stdin.readline().strip())
if len(s) == 6 and s[2] == s[3] and s[4] == s[5] and len(set(s)) == 4:
        print("Yes")
else:
        print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()
s_list = list(s)

def has_duplicates(seq):
    return len(seq) != len(set(seq))

if has_duplicates(s_list):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S = input()

if(S[2]==S[3] and S[4]==S[5]):
    print("yes")
    exit()

print("No")

Submission status: Wrong Answer

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

main()

Submission status: Wrong Answer

Solution code:
s = input()
if len(s) < 6:
  print('No')
elif s[-1] == [-2] and s[-3] == s[-4]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
str = input()

flag = False

if str[2] == str[3] and str[4] == str[5]:
  flag = True
  
print(flag)

Submission status: Wrong Answer

Solution code:
S=input()
a=S[2]
b=S[3]
d=S[-2]
e=S[-1]
if(a==b):
  if(d==e):
    print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s=list(input())
if s[2]==s[3]  and s[4]==s[5]:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
n=str(input())
a=list(n)
if n.find(a[2],3,4)!=-1 & n.find(a[4],5,6)!=-1:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s=input()
for i in range(0,6):
  if(s[3]==s[4] and s[4]==s[5]):
    print("yes")
    break
  else:
    print ("no")
    break

Submission status: Wrong Answer

Solution code:
i_str = input()
anser = 'No'
if i_str[3:3] == i_str[4:4]:
  if i_str[5:5] == i_str[6:6]:
    anser = 'Yes'
    
print(anser)

Submission status: Wrong Answer

Solution code:
A = input()
ans = 1

for i,j in enumerate(A):
    if i == 2:
        second = j
    if i == 3:
        if j != second:
            ans *= 0
    if i == 4:
        forth = j
    if j == 5:
        if j != forth:
            ans *= 0

if ans == 1:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S=input()

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

Submission status: Wrong Answer

Solution code:
S = input()

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

Submission status: Wrong Answer

Solution code:
s = input()
ans = "No"

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

print(ans)

Submission status: Wrong Answer

Solution code:
S = input()

if S[2:] == 'ffee':
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s=input()
t=str("coffee")
x=1
for i in range(3,6):
    if s[i]!=t[i]:
        x=0
        print("No")
        break
        
if x==1:
    print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

s = list(input())

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

Submission status: Wrong Answer

Solution code:
s=input()
print(s[2]==s[3] and s[4]==s[5])

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

Solution code:
N = input()

N = list(N)

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

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = list(input())

print(S)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
lst = list(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = str(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:


st = input()

if ( (st[2] == st[3]) and (st[4] == st[5]) ) :
    print ('YES')
else:
    print ('NO')

Submission status: Wrong Answer

Solution code:
S = input()

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

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import collections
import math
import numpy as np
#H, W, K = map(int, input().split(' '))
S = input()

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

Submission status: Wrong Answer

Solution code:
S=input()

ans="No"

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()
h = s

if s == h:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
S=input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
if __name__ == "__main__":
    S = input()
    print((S[2] == S[3]) & (S[4] == S[5]))

Submission status: Wrong Answer

Solution code:
"""
Author    : co_devil Chirag Garg
Institute : JIIT
"""
from math import factorial
from math import log, ceil
from collections import defaultdict
from math import *
from sys import stdin, stdout
import itertools
import os
import sys
import threading
from collections import deque, Counter, OrderedDict, defaultdict
from heapq import *
# from math import ceil, floor, log, sqrt, factorial, pow, pi, gcd
# from bisect import bisect_left,bisect_right
# from decimal import *,threading
from fractions import Fraction
mod = int(pow(10, 9)+7)


def ii(): return int(input())


def si(): return str(input())


def mi(): return map(int, input().split())


def li(): return list(mi())


def fii(): return int(stdin.readline())


def fsi(): return str(stdin.readline())


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


def fli(): return list(fmi())


abd = {'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12,
       'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24,
       'z': 25}


def getKey(item): return item[0]


def sort2(l): return sorted(l, key=getKey)


def d2(n, m, num): return [[num for x in range(m)] for y in range(n)]


def isPowerOfTwo(x): return (x and (not (x & (x - 1))))


def decimalToBinary(n): return bin(n).replace("0b", "")


def ntl(n): return [int(i) for i in str(n)]


def powerMod(x, y, p):
    res = 1
    x %= p
    while y > 0:
        if y & 1:
            res = (res * x) % p
        y = y >> 1
        x = (x * x) % p
    return res


graph = defaultdict(list)
visited = [0] * 1000000
col = [-1] * 1000000


def bfs(d, v):
    q = []
    q.append(v)
    visited[v] = 1
    while len(q) != 0:
        x = q[0]
        q.pop(0)
        for i in d[x]:
            if visited[i] != 1:
                visited[i] = 1
                q.append(i)
        print(x)


def make_graph(e):
    d = {}
    for i in range(e):
        x, y = mi()
        if x not in d:
            d[x] = [y]
        else:
            d[x].append(y)
        if y not in d:
            d[y] = [x]
        else:
            d[y].append(x)
    return d


def gr2(n):
    d = defaultdict(list)
    for i in range(n):
        x, y = mi()
        d[x].append(y)
    return d


def connected_components(graph):
    seen = set()

    def dfs(v):
        vs = set([v])
        component = []
        while vs:
            v = vs.pop()
            seen.add(v)
            vs |= set(graph[v]) - seen
            component.append(v)
        return component

    ans = []
    for v in graph:
        if v not in seen:
            d = dfs(v)
            ans.append(d)
    return ans


def primeFactors(n):
    s = set()
    while n % 2 == 0:
        s.add(2)
        n = n // 2
    for i in range(3, int(sqrt(n)) + 1, 2):
        while n % i == 0:
            s.add(i)
            n = n // i
    if n > 2:
        s.add(n)
    return s


def find_all(a_str, sub):
    start = 0
    while True:
        start = a_str.find(sub, start)
        if start == -1:
            return
        yield start
        start += len(sub)


def SieveOfEratosthenes(n, isPrime):
    isPrime[0] = isPrime[1] = False
    for i in range(2, n):
        isPrime[i] = True
    p = 2
    while (p * p <= n):
        if (isPrime[p] == True):
            i = p * p
            while (i <= n):
                isPrime[i] = False
                i += p
        p += 1
    return isPrime


def dijkstra(edges, f, t):
    g = defaultdict(list)
    for l, r, c in edges:
        g[l].append((c, r))

    q, seen, mins = [(0, f, ())], set(), {f: 0}
    while q:
        (cost, v1, path) = heappop(q)
        if v1 not in seen:
            seen.add(v1)
            path = (v1, path)
            if v1 == t:
                return (cost, path)

            for c, v2 in g.get(v1, ()):
                if v2 in seen:
                    continue
                prev = mins.get(v2, None)
                next = cost + c
                if prev is None or next < prev:
                    mins[v2] = next
                    heappush(q, (next, v2, path))
    return float("inf")


def binsearch(a, l, r, x):
    while l <= r:
        mid = l + (r-1)//2
        if a[mid]:
            return mid
        elif a[mid] > x:
            l = mid-1
        else:
            r = mid+1
    return -1


# def dfs(d, v):
#     q = []
#     q.insert(0, v)
#     visited[v] = 1
#     while len(q) != 0:
#         x = q[0]
#         q.pop(0)
#         for i in d[x]:
#             if visited[i] != 1:
#                 visited[i] = 1
#                 q.insert(0, i)
#         print(x)
s = si()
if s[2] == s[3] and s[4] == s[5]:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
S = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

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




# 332701087 1753412895

Submission status: Wrong Answer

Solution code:
#文字列の入力
S = input()
S_list = list(S)
if(S_list[2]==S_list[3]):
  if(S_list[4]==S_list[5]):
    print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = str(input())
if len(x)==6:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

else:
    print("NO")

Submission status: Wrong Answer

Solution code:
S=list(input())

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

Submission status: Wrong Answer

Solution code:
I=lambda:list(map(int,input().split()))
s=list(input())
if s[2]==s[4] or s[2]==s[5] or s[3]==s[4] or s[5]:
    print("Yes")
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()

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

Submission status: Wrong Answer

Solution code:
data = input()

if data[2:4] == data[4:6]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!python3

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

def resolve():
    s = input()

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

if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Time Limit Exceeded

Solution code:

for i in range(10**11):
    pass

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:
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:
string = 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:
#!/usr/local/bin/python3
# https://atcoder.jp/contests/agc014/tasks/agc014_a
# int(input())
# input().split()
# map(int, input().split())
# list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
S = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if n[2] == n[3]:
    if n[4] == n[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')
        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:
def sep():
    return map(int,input().strip().split(" "))
def lis():
    return list(sep())
import sys
sys.setrecursionlimit(10**6)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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