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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
x = input()
mylist = list(x)

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
S= list(input())

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

Submission status: Accepted

Solution code:
S = list(str(input()))

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

Submission status: Accepted

Solution code:
S = 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())
#print(s)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inputText1 = input()
# inputText1 = "sippau"
textList = list(inputText1)
# print(textList)
# ['s', 'i', 'p', 'p', 'u', 'u']
flg = False
if textList[2] == textList[3]:
    if textList[4] == textList[5]:
        flg = True

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 標準入力
s = input()

hoge = list(s)
# print(hoge)

# flag = False

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
#Input
s = input()

#Process
Ans = "No"
if(s[2] == s[3] and s[4] == s[5]):
    Ans = "Yes"

#Output
print(Ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def is_similar_coffee(s):
    if s[2] != s[3]:
        return False
    elif s[4] != s[5]:
        return False
    return True


s = input()
if is_similar_coffee(s):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().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:
# -*- coding: utf-8 -*-
text = list(input())
if text[2] == text[3]:
    if text[4]==text[5]:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys
import random
import itertools
import math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt


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


def LF(): return list(map(float, input().split()))


def LI_(): return list(map(lambda x: int(x)-1, input().split()))


def II(): return int(input())


def IF(): return float(input())


def S(): return input().rstrip()


def LS(): return S().split()


def IR(n): return [II() for _ in range(n)]


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


def FR(n): return [IF() for _ in range(n)]


def LFR(n): return [LI() for _ in range(n)]


def LIR_(n): return [LI_() for _ in range(n)]


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


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


mod = 1000000007
inf = 1e10

#solve


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


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

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:
word = list(str(input()))
if word[2] == word[3] and word[4] == word[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:
inputString = input()
boolFirst = False
boolSecond = False
if inputString[2] == inputString[3]:
    boolFirst = True
if inputString[4] == inputString[5]:
    boolSecond = True
if boolFirst and boolSecond:
    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():
    arg = getInput(input())
    # arg = getInput(input())
    ans = process(arg)
    print(ans)
    
def process(arg):
    cof = list('coffee')
    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()

Submission status: Accepted

Solution code:
S=input()

if(S[2]==S[3] and S[4]==S[5] and S[0]!=S[1]):
 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:
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:
# 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()
for i in range(0,6):
  if(s[2]==s[3] and s[4]==s[5]):
    print("Yes")
    break
  else:
    print ("No")
    break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s1,s2,s3,s4,s5,s6=input()
#print(S)
ans='No'
if(s3==s4):
  if(s5==s6):
    ans='Yes'
else:
  ans='No'
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

#print(s[3])

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:
#!/usr/bin/env python
from __future__ import division, print_function

import os
import sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip


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


# region fastio

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

input = lambda: sys.stdin.readline().rstrip("\r\n")

# endregion

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

Solution code:
dat=input()
if dat[2] == dat[3] and dat[4] == dat[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:
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:
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()
    n = []
    for i in s:
        n.append(i)
        
    if (n[2]==n[3]) & (n[4]==n[5]):
        print("Yes")
    else:
        print("No")
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#At coder 2020/3/27 A
# 文字列の入力
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] and s[4] == s[5]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys


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


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

if __name__ == "__main__":

    main()

Submission status: Accepted

Solution code:
x=input("")
l=len(x)
if l>=6 and x[2]==x[3] and x[4]==x[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()
temp = []
for i in S:
    temp.append(i)
if temp[2] == temp [3] and temp[4] == temp[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()
print('Yes' if s[2] in s[3] and s[4] in s[5] else '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]:
  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")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Jan 19 20:52:57 2020

@author: over-
"""

S=input()

ans="No"
if S[2]==S[3] and  S[4]==S[5]:
    ans="Yes"

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import sys

stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))
mod = 10**9 + 7 
sys.setrecursionlimit(1000010)


S = ns()

if S[2] != S[3]:
    print('No')
    exit(0)

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

print('Yes')

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

else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from bisect import bisect_right, bisect_left
import random
from itertools import permutations, accumulate, combinations, product
from re import split
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, gamma, log
from operator import mul
from functools import reduce
from copy import deepcopy
import re

sys.setrecursionlimit(2147483647)
INF = 10 ** 20
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
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)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
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 = ""

def format_input(filename = None):
	global s
	if filename == None:
		s = str(input())

	elif filename == '__random__':
		from random import randint as rng
		from random import choices
		s = ''.join(choices('abcdefghijklmnopqrstuvwxyz', k = 6))
		print(s)

def get_answer():
	answer = 'No'
	if s[2] == s[3] and s[4] == s[5]:
		answer = 'Yes'
	return answer

if __name__ == '__main__':
	format_input()

	ans = get_answer()
	print(ans)

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

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

Submission status: Accepted

Solution code:
s = input()

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

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

Submission status: Accepted

Solution code:
S = raw_input()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

word = input()

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

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
    if row <= 0:
        return [[] for _ in range(col)]
    elif col == 1:
        return [I() for _ in range(row)]
    else:
        read_all = [LI() for _ in range(row)]
        return map(list, zip(*read_all))

#################

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

print("No")

Submission status: Accepted

Solution code:
S = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

str = input()
strlist = list(str)

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

Submission status: Accepted

Solution code:
S = str(input())

if all([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]:
      
    if str(A[4])==str(A[5]):
        print("Yes")
    elif str(A[4])!=str(A[5]):
        print("No")

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# simply use double ifs
s = input()
if s[2] != s[3]:
	print('No')
elif s[4] != s[5]:
	print('No')
else:
	print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

a = "No"
if N[2] == N[3] and N[4] == N[5]:
    a = "Yes"

print(a)

Submission status: Accepted

Solution code:
from sys import stdin,stdout
Pi = lambda x: stdout.write(str(x) + '\n')
S = lambda x: x*(x+1) // 2
I = lambda x: 1+(2*x)
R = lambda:stdin.readline()
Ri = lambda x:map(int,x.split())
Rs = lambda x:map(str,x.split())
Rf = lambda x:map(float,x.split())
 
def main():	
	# t = int(R())
	for x in stdin:
		s = x.strip('\n')
		if s[2]==s[3] and s[4] == s[5]:
			Pi('Yes')
		else:
			Pi('No')


if __name__=='__main__':
	main()

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()
x = [s[i:i+1] for i in range(6)]

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    S = input()
    if len(S) != 6 or S[2] != S[3] or S[4] != S[5]:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
import sys
# sys.stdin = open('input.txt')

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

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


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


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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    #H , W = map(int, input().split())
    S = str(input())

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

    #print (str(num_cycle))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())
kotae = "No"

if S[2] == S[3] and S[4] == S[5]:
    if not(S[0] == S[1] and S[1] == S[2] and S[2] == S[4]):
        kotae = "Yes"

print(kotae)

Submission status: Accepted

Solution code:
import sys
 
s = list(sys.stdin.readline().strip())
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:
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[3-1] == S[4-1] and S[5-1]==S[6-1]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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: Accepted

Solution code:
from sys import stdin
s = str(stdin.readline().rstrip())

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

Submission status: Accepted

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 i == 5:
        if j != forth:
            ans *= 0

if ans == 1:
    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:
def calc(s):
    if(s.islower() and len(s)==6):
        if(s[2]==s[3] and s[4]==s[5]):
            return "Yes"
        else:
            return "No"
s=input()
print(calc(s))

Submission status: Accepted

Solution code:
s=str(input())

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