Problem:


Score : 100 points

Problem Statement

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

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

Constraints

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

Input

Input is given from Standard Input in the following format:

S

Output

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

Sample Input 1

sippuu

Sample Output 1

Yes

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

Sample Input 2

iphone

Sample Output 2

No

Sample Input 3

coffee

Sample Output 3

Yes



Sample input:
sippuu


Sample output:
Yes

Submission status: Accepted

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


def main():
    S = input()

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

Solution code:
# -*- 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()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def check(s):
    return s[2] == s[3] and s[4] == s[5]
s = input()
if check(s):
    print('Yes');
else:
    print('No');

Submission status: Accepted

Solution code:
A = input()

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


print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 2020/03/28
# AtCoder Beginner Contest 160 - A

# Input
s = input()

# Calc
if s[2] == s[3] and s[4] == s[5]:
    ans = "Yes"
else:
    ans = "No"

# Output
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 string
def num():
    return int(input())
def nums():
    return 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 = 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:
# /usr/bin/python3
# -*- coding: utf-8 -*-
from queue import Queue
from queue import LifoQueue as Stack
from math import sqrt, floor, ceil, log2
from fractions import gcd
from itertools import permutations, combinations
from operator import itemgetter
from functools import cmp_to_key



__MOD__=(10**9)+7
yn = 'YNeos'
judge = False
cnt = 0
ans = None


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

def intinput():
    return int(input())

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

def lineinputs(func=intinput):
    datas = []
    while True:
        try:
            datas.append(func())
        except EOFError:
            break
    return datas

class ModInt():
    def __init__(self, x):
        self.__x = (x % __MOD__)
    def __add__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x + other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x + other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __sub__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x - other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x - other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __mul__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x * other.__x)%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x * other.__x)%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __truediv__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__((self.__x * other.__modinv())%__MOD__))
        elif type(other) == ModInt:
            return self.__class__((self.__x * other.__modinv())%__MOD__)
        else:
            raise Exception("Not Int or Not ModInt")
    def __pow__(self, other):
        if type(other) == int:
            other = self.__class__(other)
            return int(self.__class__(pow(self.__x, other.__x, __MOD__)))
        elif type(other) == ModInt:
            return self.__class__(pow(self.__x, other.__x, __MOD__))
        else:
            raise Exception("Not Int or Not ModInt")
    def __modinv(self, m=__MOD__):
        a = self.__x
        if a == 0:
            raise ZeroDivisionError()
        if gcd(a, m) != 1:
            raise Exception("%sの逆数は求まりません。" % a)
        b, u, v = m, 1, 0
        while b != 0:
            t = a//b;
            a -= t*b
            a, b = b, a
            u -= t * v
            u, v = v, u
        u %= m
        if u < 0:
            u += m
        return u
    def __int__(self):
        return self.__x



if __name__ == '__main__':
    S = input()

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
n = input()
if n[2] == n[3] and n[4] == n[5]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#
import sys
import math
import numpy as np
import itertools

# 文字列を一文字ずつのリストに代入 test は['t', 'e', 's', 't']
m = list(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    #from sys import stdin, setrecursionlimit
    #setrecursionlimit(10**9)
    #r = input()
    #n = int(input())
    #a, b = map(int, input().split())
    #s, y = input().split()
    #a = input().split()
    #a = list(map(int, input().split()))
    #a = [list(input().split()) for i in range(n)]
    #a = [int(input()) for i in range(n)]
    #a = [list(map(int, input().split())) for i in range(n)]
    #a = [int(s) - 1 for s in input().split()]
    #l=[int(input()) for _ in range(int(input()))]
    #res = 0
    s=input()
    if s[2]==s[3] and s[4]==s[5]:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Submission status: Accepted

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

S = input()
print(calc(S))

Submission status: Accepted

Solution code:
# AtCoder Beginner Contest 160: A (2020/03/28)
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] == s[2] 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 read():
    S = input()
    return S, 

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

if __name__ == '__main__':
    inputs = read()
    print("{}".format(solve(*inputs)))

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()
flag = True
if s[2] != s[3]:
    flag = False
elif s[4] != s[5]:
    flag = False
if flag == True:
    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:
import sys
input = sys.stdin.readline
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
# -*- coding: utf-8 -*-


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#n = int(input())
#a,b = map(int,input().split())
#a_L = list(map(int,input().split()))
s = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

S = input()

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

Submission status: Accepted

Solution code:
S = input()

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    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 math
# map(int, input().split())
# int(input())
# input().split()
S = input()
if S[2] == S[3] and S[4] == S[5]: print("Yes")
else: print("No")

Submission status: Accepted

Solution code:
import sys
import os
from io import BytesIO, IOBase

#########################
# imgur.com/Pkt7iIf.png #
#########################

# returns the list of prime numbers less than or equal to n:
'''def sieve(n):
    if n < 2: return list()
    prime = [True for _ in range(n + 1)]
    p = 3
    while p * p <= n:
        if prime[p]:
            for i in range(p * 2, n + 1, p):
                prime[i] = False
        p += 2
    r = [2]
    for p in range(3, n + 1, 2):
        if prime[p]:
            r.append(p)
    return r'''

# returns all the divisors of a number n(takes an additional parameter start):
'''def divs(n, start=1):
    divisors = []
    for i in range(start, int(math.sqrt(n) + 1)):
        if n % i == 0:
            if n / i == i:
                divisors.append(i)
            else:
                divisors.extend([i, n // i])
    return divisors'''

# returns the number of factors of a given number if a primes list is given:
'''def divn(n, primes):
    divs_number = 1
    for i in primes:
        if n == 1:
            return divs_number
        t = 1
        while n % i == 0:
            t += 1
            n //= i
        divs_number *= t
    return divs_number'''

# returns the leftmost and rightmost positions of x in a given list d(if x isnot present then returns (-1,-1)):
'''def flin(d, x, default=-1):
    left = right = -1
    for i in range(len(d)):
        if d[i] == x:
            if left == -1: left = i
            right = i
    if left == -1:
        return (default, default)
    else:
        return (left, right)'''

# returns (b**p)%m 
'''def modpow(b,p,m):
    res=1
    b=b%m
    while(p):
        if p&1:
            res=(res*b)%m
        b=(b*b)%m
        p>>=1
    return res'''

# if m is a prime this can be used to determine (1//a)%m or modular multiplicative inverse of a number a
'''def mod_inv(a,m):
    return modpow(a,m-2,m)'''

# returns the ncr%m for (if m is a prime number) for very large n and r
'''def ncr(n,r,m):
    res=1
    if r==0:
        return 1
    if n-r<r:
        r=n-r
    p,k=1,1
    while(r):
        res=((res%m)*(((n%m)*mod_inv(r,m))%m))%m
        n-=1
        r-=1
    return res'''

# returns ncr%m (if m is a prime number and there should be a list fact which stores the factorial values upto n):
'''def ncrlis(n,r,m,fact):
    return (fact[n]*(mod_inv(fact[r],m)*mod_inv(fact[n-r],m))%m)%m'''

#count xor of numbers from 1 to n:
def xor1_n(n):
    d={0:n,1:1,2:n+1,3:0}
    return d[n&3]

def ceil(n, k): return n // k + (n % k != 0)
def ii(): return int(input())
def mi(): return map(int, input().split())
def li(): return list(map(int, input().split()))
def lcm(a, b): return abs(a * b) // math.gcd(a, b)
def prr(a, sep=' '): print(sep.join(map(str, a)))
def dd(): return collections.defaultdict(int)
def ddl(): return collections.defaultdict(list)
def ddd(): return collections.defaultdict(collections.defaultdict(int))
 

# 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")
 

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

#import collections
#from collections import deque
#import math
#import time
#import itertools
#import timeit
#import random
#from bisect import bisect_left as bl
#from bisect import bisect_right as br
#from bisect import insort_left as il
#from collections import OrderedDict

for _ in range(1):
    s=input()
    if s[2]==s[3] and s[4]==s[5]:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
S=input()
ans="coffee"


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

Submission status: Accepted

Solution code:

import sys
from io import StringIO
import unittest

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline



    #n,m,k=map(int, readline().rstrip().split())
    #arr=list(map(int, readline().rstrip().split()))
    #n=int(readline())
    ss=readline().rstrip()
    
    yn(ss[2]==ss[3] and ss[4]==ss[5])

    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

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:
# Code for A - Coffee
# Use input() to fetch data from STDIN
s = input()
if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#!python3.4
# -*- coding: utf-8 -*-
# abc160/abc160_a
import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

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

main()

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
S=input()
flg=True

if S[2]!=S[3]:
    flg=False

if S[4]!=S[5]:
    flg=False

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

Submission status: Accepted

Solution code:
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time


def I(): return int(input())


def S(): return input()


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


def MS(): return map(str, input().split())


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


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


yn = {False: 'No', True: 'Yes'}
YN = {False: 'NO', True: 'YES'}
MOD = 10**9+7
inf = float('inf')
IINF = 10**10
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']

show_flg = False
# show_flg = True


def main():
    s = S()

    print(yn[s[2] == s[3] and s[4] == s[5]])


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

import math
import itertools
import statistics
#import collections
#n = int(input())
#A = (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:
#!/usr/bin/env python3
s = input()
if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
from sys import stdin
from operator import itemgetter
import math
# stdin = open("sample.txt")

s = stdin.readline().rstrip()

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

Submission status: Accepted

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

S = input()

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

Submission status: Accepted

Solution code:
from sys import stdin

def main():

    input = stdin.readline

    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:
'''
.append(要素) リストに要素を追加
.extend(リスト) リストを連結する
.insert(場所,要素) 指定した場所に要素追加
del 配列名[場所]
-1で末尾で末尾から一つ前

sort()
sorted(reverse=true)

配列の初期化
配列名=[a]*n+[b]*m

Decimal()
'''

from sys import stdin
from itertools import accumulate, dropwhile, takewhile, groupby
import bisect
import copy
import math
from functools import reduce
from operator import mul
from collections import Counter
import itertools


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

Submission status: Accepted

Solution code:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

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:
import math

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()
# X1_list = [int(input()) for i in range(N)]
# X2_list = [list(map(int,input().split())) for i in range(N)]
if S[2] == S[3] and S[4] == S[5]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def rMap():
	return map(int,input().split())
def rList():
	return list(map(int,input().split()))
s = input()
print("Yes" if s[3] == s[2] 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:
'''
Created on 2020/03/28

@author: fanta
'''
S = str(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().rstrip("\r\n")
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:
n = input()
if (n[2]==n[3])&(n[4]==n[5]):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
def inp():
    return input()
def iinp():
    return int(input())
def inps():
    return input().split()
def miinps():
    return map(int,input().split())
def linps():
    return list(input().split())
def lmiinps():
    return list(map(int,input().split()))
def lmiinpsf(n):
    return [list(map(int,input().split()))for _ in range(n)]

s = inp()

if s[2] != s[3]:
  print("No")
  exit()
elif s[4] != s[5]:
  print("No")
  exit()

print("Yes")

Submission status: Accepted

Solution code:
import sys
import math
import collections
from collections import deque
#n = int(input())
#n, s = map(int, sys.stdin.readline().split())
s = input()
#a = list(map(int, sys.stdin.readline().split()))

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

    return 0


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    S = input()
    if S[2] != S[3]:
        print("No")
        exit()
    if S[4] != S[5]:
        print('No')
        exit()
    print('Yes')
if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

S = read().decode().rstrip()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math
from collections import deque
def main():
    s = list(input())
    if s[2]==s[3] and s[4]==s[5]:
        print("Yes")
    else:
        print("No")
        


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
s = input().strip()

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

Submission status: Accepted

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

Submission status: Accepted

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



if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin
#N, M, C = (int(i) for i in input().split())
#B = [int(x) for x in stdin.readline().rstrip().split()]
#A = [[int(i) for i in input().split()] for i 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]==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:
import sys
input = lambda: sys.stdin.readline().rstrip() 

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

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
s = input().strip()
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]:
        return "Yes"
    return "No"  

if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
import math
import copy
from copy import deepcopy
import sys
import fractions
# import numpy as np
from functools import reduce
# import statistics
import decimal
import heapq
import collections
import itertools
from operator import mul

sys.setrecursionlimit(100001)


# input = sys.stdin.readline
# sys.setrecursionlimit(10**6)

# ===FUNCTION===

def getInputInt():
    inputNum = int(input())
    return inputNum


def getInputListInt():
    outputData = []
    inputData = input().split()
    outputData = [int(n) for n in inputData]

    return outputData


def getSomeInputInt(n):
    outputDataList = []
    for i in range(n):
        inputData = int(input())
        outputDataList.append(inputData)

    return outputDataList


def getSomeInputListInt(n):
    inputDataList = []
    outputDataList = []
    for i in range(n):
        inputData = input().split()
        inputDataList = [int(n) for n in inputData]
        outputDataList.append(inputDataList)

    return outputDataList


# ===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
import math
from functools import reduce
from operator import mul
sys.setrecursionlimit(10**6)

def InMap(): return list(map(int, sys.stdin.readline().split(' ')))
def In(): return int(sys.stdin.readline())
def InS(): return sys.stdin.readline()

S = InS()[:-1]

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

print('No')

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = 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:
import sys

s = sys.stdin.readline().rstrip()

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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:
*_,a,b,c,d=input()
print('YNeos'[a+c!=b+d::2])

Submission status: Accepted

Solution code:
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : 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 = input()
if s[2]==s[3] and s[4]==s[5]:
    print('Yes')
else:
    print("No")