Problem:


Score : 100 points

Problem Statement

A string of length 6 consisting of lowercase English letters is said to be coffee-like if and only if its 3-rd and 4-th characters are equal and its 5-th and 6-th characters are also equal.

Given a string S, determine whether it is coffee-like.

Constraints

S is a string of length 6 consisting of lowercase English letters.

Input

Input is given from Standard Input in the following format:

S

Output

If S is coffee-like, print Yes; otherwise, print No.

Sample Input 1

sippuu

Sample Output 1

Yes

In sippuu, the 3-rd and 4-th characters are equal, and the 5-th and 6-th characters are also equal.

Sample Input 2

iphone

Sample Output 2

No

Sample Input 3

coffee

Sample Output 3

Yes



Sample input:
sippuu


Sample output:
Yes

Submission status: Accepted

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

if s[4] != s[5]:
  print('No')
  exit()

print('Yes')

Submission status: Accepted

Solution code:
user_input = input()
container = []
for char in user_input:
    container.append(char)
if (container[2] == container[3]) and (container[4] == container[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:
string=input()
ans= "No"
if len(string) != 6:
	print(ans)
else:
  if string[2] == string[3] and string[4] == string[5]:
    ans="Yes"
    print(ans)
  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().strip()
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:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = [i for i in input()]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

from sys import stdin, stderr

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

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

   return 0

if __name__ == '__main__': main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
for i in range(1,3):
    j=i*2
    if not s[j]==s[j+1]:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

Solution code:
S = input()

Flag = True

if S[2] != S[3] or S[4] != S[5]:
    Flag = False

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

Submission status: Accepted

Solution code:
# A = [list(map(int, input().split())) for _ in range(3)]
# H = int(input())
# B = [int(input()) for _ in range(n)]
# A = list(map(int, input().split()))
# a, b = 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=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]):
    if(a[4] == a[5]):
            print("Yes")
    else:
            print("No")
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:
string = input()
string.split()
if string[2] == string[3] and string[4] == string[5]:
	print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/python
# -*- coding: utf-8 -*-

# 入力はstringで入る．
# intにしたければ int(input())
# floatで受け取ると 1.0 になる．

# 入力 : S
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

if len(S) >= 6:
    if S[2] is S[3] and S[4] is 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:
m=input()
if m[2]==m[3] and m[4]==m[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:
import collections

local = False
if local:
    file = open("A.txt", "r")

def inp():
    if local:
        return file.readline().rstrip()
    else:
        return input().rstrip()

S = inp()

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

Submission status: Accepted

Solution code:
S = input()


judge = (S[2] == S[3] and S[4] == S[5])

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

Submission status: Accepted

Solution code:
a = str(input())
if len(a) >= 5:
    if a[2] == a[3] and a[4] == a[5]:
        print("Yes")
    else:
        print("No")
else:
    print('len should be more than 5')

Submission status: Accepted

Solution code:
from sys import stdin


inp = stdin.readline

t = inp().strip()

if t[2] == t[3] and t[4] == t[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:
def get_count(text):
    if text[2] == text[3] and text[4] == text[5]:
        return 'Yes'
    else:
        return 'No'
 
 
if __name__ == '__main__':
    string = input().strip()
 
    result = get_count(string)
    print(result)

Submission status: Accepted

Solution code:
def get_count(text):
    if text[2] == text[3] and text[4] == text[5]:
        return 'Yes'
    else:
        return 'No'


if __name__ == '__main__':
    string = input().strip()

    result = get_count(string)
    print(result)

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

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

Submission status: Accepted

Solution code:
S=input()

def coffee_judge(S):
    likecoffee=False
    if S[2]==S[3] and S[4]==S[5]:
        likecoffee=True
    
    if likecoffee==True:
        ans="Yes"
    else:
        ans="No"
    return ans

print(coffee_judge(S))

Submission status: Accepted

Solution code:
a=input()
b=0
c=len(a)
if c>=6:
    if a[2]==a[3]:
        if a[4]==a[5]:
            b=1
if b==1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import unittest


class TestA(unittest.TestCase):
    def test_1(self):
        self.assertEqual(think('sippuu'), 'Yes')

    def test_2(self):
        self.assertEqual(think('iphone'), 'No')

    def test_3(self):
        self.assertEqual(think('coffee'), 'Yes')


def solve():
    s = read()
    result = think(s)
    write(result)


def read():
    return read_line()


def read_int(n):
    return read_type(int, n, sep=' ')


def read_float(n):
    return read_type(float, n, sep=' ')


def read_type(t, n, sep):
    return list(map(lambda x: t(x), read_line().split(sep)))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(data):
    return 'Yes' if data[2] == data[3] and data[4] == data[5] else 'No'


def write(result):
    print(result)


if __name__ == '__main__':
    # unittest.main()
    solve()

Submission status: Accepted

Solution code:
S = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

flag = False

if S[2] == S[3]:
  if S[4]== S[5]:
    flag = True

if flag == True:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
x = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
def main():
    s = list(input())
    
    if(len(s)!=6):
        main()
    
    for e in s:
        if(e.islower()==False):
            main()
    
    if(s[2]==s[3] and s[4]==s[5]):
        print("Yes")
    else:
        print("No")
main()

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
S = list(input())

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

Submission status: Accepted

Solution code:
nyuryoku = input()

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

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

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

Submission status: Accepted

Solution code:
a = input().strip()
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:3]) == (S[3:4])):
    if((S[4:5]) == (S[5:])):
        print('Yes');
    else:
        print('No');
else:
    print('No');

Submission status: Accepted

Solution code:
S=input()
a=len(set(S[2:4]))
b=len(set(S[4::]))
print("Yes" if a==1 and b==1 else "No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    s = input()

    main(s)

Submission status: Accepted

Solution code:
def printYN(c): print("Yes") if c else print("No")


s = input()

flag = s[2] == s[3] and s[4] == s[5]
printYN(flag)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def input():
    return sys.stdin.readline().strip()


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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s=input()
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:
# coding: UTF-8
import os

def remove_empty(target_list: list):
    empty_removed_list = [x for x in target_list if x]
    return empty_removed_list

def get_stdin_str_list():
    input_str = input().strip()
    input_str_list = input_str.split()
    return input_str_list

def get_stdin_int_list():
    input_str_list = get_stdin_str_list()
    input_int_list = list(map(input_str_list, int))
    return input_int_list


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

Submission status: Accepted

Solution code:
# coding: utf-8

import sys
import math
import collections
import itertools
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]

S = input()

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

Submission status: Accepted

Solution code:
# coding: utf-8

import sys
import math
import collections
import itertools
from inspect import currentframe
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

S_list = []
for i in S:
    S_list.append(i)

if S_list[2] == S_list[3] and S_list[4] == S_list[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:
s = input()

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

Submission status: Accepted

Solution code:
#A
S = input()
Slist = list(S)
if Slist[2] == Slist[3] and Slist[4] == Slist[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 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();print('YNeos'[s[2]!=s[3]or s[4]!=s[5]::2])

Submission status: Accepted

Solution code:
import math
import string
import collections
from collections import Counter


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


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor


# coordinates
dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]

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

Submission status: Accepted

Solution code:
input_value = input()

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

Submission status: Accepted

Solution code:
s = input()
count = 0
if s[2]==s[3]:
  count = count + 1
if s[4]==s[5]:
  count = count + 1
  
if count == 2:
  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:
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:
#import pysnooper
#import numpy
#import os,re,sys,operator
#from collections import Counter,deque
#from operator import itemgetter,mul
#from itertools import accumulate,combinations,groupby,combinations_with_replacement,permutations
from sys import stdin,setrecursionlimit
#from bisect import bisect_left,bisect_right
#from copy import deepcopy
#import heapq
#import math
#import string
#from time import time
#from functools import lru_cache,reduce
#from math import factorial,hypot
#import sys
#from fractions import gcd
setrecursionlimit(10**6+1)
input=stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()
ans='No'

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

Submission status: Accepted

Solution code:


def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    s=input()
    
    if s[2]==s[3] and s[4]==s[5]:
        print("Yes")
    else:
        print("No")

main()

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
s = readline().rstrip().decode('utf-8')

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
s = str(input())
if s[2]==s[3] and s[4]==s[5]:
    print("Yes")
    sys.exit(0)

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:
# Problem

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

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

print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
def judge(str):
    if(str[2]==str[3] and str[4]==str[5]):
        return 0
    else:
        return 1

x = list(input())
if(judge(x) == 0):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
z = input()
b=0

if z[2] == z[3]:
    if z[4] == z[5]:
        print('Yes')
        b  = 1


if b==0:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

Submission status: Accepted

Solution code:
import re
s = str(input())
r = re.match(r"(.)(.)(.)(.)(.)(.)", s)
if r.group(3) == r.group(4):
    if r.group(5) == r.group(6):
        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 len(s) <  6:
    print('-1')

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

Submission status: Accepted

Solution code:
# A - Coffee
def main():
    S = input().rstrip()
    is_coffee_like = S[2] == S[3] and S[4] == S[5]
    print("Yes" if is_coffee_like else "No")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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, deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect

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


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


def LS(): return [list(x) for x in sys.stdin.readline().split()]


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


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


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


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


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


sys.setrecursionlimit(1000000)
mod = 1000000007


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


if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp = input()

def isvalid(inp):
    if len(inp) < 6:
        return 'No'
    if not inp.islower():
        return 'No'
    
    if inp[2] == inp[3] and inp[4] == inp[5]:
        return 'Yes'
    return 'No'
    
print(isvalid(inp))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8
s = input()
h = []
for i in range(len(s)):
    h.append(s[i])

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

print(ans)

Submission status: Accepted

Solution code:
#coffee
letter = input()
letters = [a for a in letter]
if letters[2] == letters[3] and letters[4] == letters[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()
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:
はいれ=input
出せ=print
文字列 = はいれ()
出せ("Yes" if 文字列[2]==文字列[3] and 文字列[4]==文字列[5] else "No")

Submission status: Accepted

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