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: Runtime Error

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

Submission status: Runtime Error

Solution code:
letters = eval(input("Enter: "))
if letters.index(2)==letters.index(3) and letters.index(4)==letters.index(5):
  print("Yes)
elif letters=="coffee-like":
  print("Yes")
else:
   print("No")

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
X, Y, A, B, C = map(int, input().split())
red_oishisa = list(map(int, input().split()))
green_oishisa = list(map(int, input().split()))
no_oishisa = list(map(int, input().split()))

red_oishisa = list(sorted(red_oishisa))[::-1]
green_oishisa = list(sorted(green_oishisa))[::-1]
no_oishisa = list(sorted(no_oishisa))[::-1]

oishisa_s = []

i=1
j=1
k=1
while(True):
    if len(oishisa_s) == X+Y:
        break
    
    hikaku_dict = dict()
    if i <= X:
        hikaku_dict['red'] = red_oishisa[i-1]
    if j <= Y:
        hikaku_dict['green'] = green_oishisa[j-1]
    if k <= C:
        hikaku_dict['no'] = no_oishisa[k-1]
    
    max_key, max_value = max(hikaku_dict.items(), key=lambda x:x[1])
    oishisa_s.append(max_value)
    if max_key == 'red':
        i += 1
    elif max_key == 'green':
        j += 1
    elif max_key == 'no':
        k += 1

print(sum(oishisa_s))

Submission status: Runtime Error

Solution code:
import random
letters = 'abcdefghijklmnopqrstuvwxyz'
S=random.choices(letters, k=5)
if  S[2] == S[3] and S[4] == S[5]:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
import statistics
K,N = map(int,input().split())
A = [int(n) for n in input().split()]

a1 = max(A)-min(A)

for i in range(len(A)-1):
    max_v = 0
    index = None
    if (A[i+1]-A[i])>max_v:
        max_v = A[i+1]-A[i]
        index = i+1

a2 = A[index-1]+abs(K-A[index])
print(a1) if a1<a2 else print(a2)

Submission status: Runtime Error

Solution code:
x,y,a,b,c = map(int,input().split())
p = list(map(int,input().split()))
p = sorted(p)

Submission status: Runtime Error

Solution code:
import numpy as np

def solve(n,x,y):
  matrix = np.full((n,n), -1)
  x = x-1
  y = y-1
  for i in range(n):
    for j in range(i+1, n):
      if j >= x:
        matrix[i][j] = min(j-i, np.abs(j-y)+np.abs(x-i)+1)
      else:
        matrix[i][j] = j-i

  for i in range(1,n):
    print(np.count_nonzero(matrix==i))

if __name__ == "__main__":
  _n, _x, _y = map(int, input().split())
  solve(_n,_x,_y)

Submission status: Runtime Error

Solution code:
usr = eval(input())
if usr[-1] == usr[-2] and usr[-3] == usr[-4]:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
x, y, a, b, c = map(int, input().split())
arrayP = list(input().split())
arrayQ = list(input().split())
arrayR = list(input().split())
arrayP.sort(reverse=True)
arrayQ.sort(reverse=True)
arrayR.sort(reverse=True)
arrayAns = []
for i in range(x):
    arrayAns.append(int(arrayP[i]))
for i in range(y):
    arrayAns.append(int(arrayQ[i]))
arrayAns.sort()
for i in range(len(arrayR)):
    if arrayAns[0] <= int(arrayR[i]):
        arrayAns[0] = int(arrayR[i])
        arrayAns.sort()
print(sum(arrayAns))

Submission status: Runtime Error

Solution code:
user_input = eval(input())
print((user_input // 500) * 1000 + ((user_input % 500) // 5) * 5)

Submission status: Runtime Error

Solution code:
k, n = map(int, input().split())
 
An = list(map(int, input().split()))
 
mn = 0
Amax = max(An)
Amin = min(An)
for i in range(len(An)):
    cal = 0
    A = An[i:]  + An[:i]
    for i in range(len(A)-1):
        if A[i] == Amax and A[i+1] == Amin:
            cal += A[i+1] + k - A[i]
        elif A[i] == Amin and A[i+1] == Amax:
            cal += A[i] + k - A[i+1]
        elif A[i+1] >= A[i]:
            cal += A[i+1] - A[i]
        else:
            cal += A[i] - A[i+1]
        
        if mn > 0 and cal > mn:
            break
    
    if mn ==0 or mn > cal:
        mn = cal
        
rAn = An[:]
rAn.reverse()
for i in range(len(rAn)):
    cal = 0
    A = rAn[i:]  + rAn[:i]
    for i in range(len(A)-1):
        if A[i] == Amax and A[i+1] == Amin:
            cal += A[i+1] + k - A[i]
        elif A[i] == Amin and A[i+1] == Amax:
            cal += A[i] + k - A[i+1]
        elif A[i+1] >= A[i]:
            cal += A[i+1] - A[i]
        else:
            cal += A[i] - A[i+1]
            
        if mn > 0 and cal > mn:
            break
 
    if mn ==0 or mn > cal:
        mn = cal
print(mn)

Submission status: Runtime Error

Solution code:
k, n = map(int,input().split())
a = list(map(int, input().split()))
ans1 = max(a) - min(a)
for i in range (0,n):
    if a[i] >= (k/2):
        a[i] = a[i] - k
ans2 = abs(max(a) - min(a))
print(min(ans1,ans2))

Submission status: Runtime Error

Solution code:
import sys
sys.setrecursionlimit(3*10**5)

n = int(input())
edge = [tuple(map(int, input().split())) for _ in range(n-1)]
mod = 10 ** 9 + 7
def extGCD(a, b):
    if b == 0:
        return a, 1, 0
    g, y, x = extGCD(b, a%b)
    y -= a//b * x
    return g, x, y

def moddiv(a, b):
    _, inv, _ = extGCD(b, mod)
    return (a * inv) % mod

N = 10 ** 5 + 10
fact = [0] * (N)
fact[0] = 1
for i in range(1, N):
    fact[i] = (fact[i-1] * i) % mod

def comb(a, b):
    return moddiv(moddiv(fact[a], fact[a-b]), fact[b])

connect = [set() for _ in range(n)]
for a, b in edge:
    connect[a-1].add(b-1)
    connect[b-1].add(a-1)

d = [{} for _ in range(n)]

def dfs(v, p):
    if p in d[v]:
        return d[v][p]
    num, count = 0, 1
    for next in connect[v]:
        if next != p:
            i, c = dfs(next, v)
            num += i
            count *= c
            count %= mod
            count *= comb(num, i)
            count %= mod
    num += 1
    d[v][p] = num, count
    return num, count

for i in range(n):
    dfs(i, -1)
    print(d[i][-1][1])

Submission status: Runtime Error

Solution code:
_in = list(map(int, input().split()))
k = _in[0]
n = _in[1]
p = 0
_i = list(map(int, input().split()))
dis = 0
mdis = k - _i[n-1] + _i[0]
for i in range(0,n-2):
    dis = _i[i+1]- _i[i]
    if dis>mdis:
        mdis = dis
print(k-mdis)

Submission status: Runtime Error

Solution code:
k,n=input().split();
a=input().split();
k=int(k);
n=int(n);
by=0;
for i in range(n):
	a[i]=int(a[i]);
for i in range(n-1):
	if a[i+1]-a[i]>by:
		by=a[i+1]-a[i];
if (k-a[n-1])+a[0]>by :
	by=(k-a[n-1])+a[0];
print(k-by);

Submission status: Runtime Error

Solution code:
a=list(input())
if(a[3]==a[4]) and (a[5]==a[6]):
  print('YES')
else:
  print('NO')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S='ejkld'
a=S[2]
b=S[3]
c=S[4]
d=S[5]

if  a == b and c == d:
    print("yes")
else:
    print("no")

Submission status: Runtime Error

Solution code:
_in = list(map(int, input().split()))
k = _in[0]
n = _in[1]
p = 0
_i = list(map(int, input().split()))
dis = 0
mdis = k - _i[n-1] + _i[0]
for i in range(1,n-2):
    dis = _i[i+1]- _i[i]
    if dis>=mdis:
        mdis = dis
print(k-mdis)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from heapq import heapify, heappush, heappop
X, Y, A, B, C = map(int, input().split())
ps = list(map(int, input().split()))
qs = list(map(int, input().split()))
rs = list(map(int, input().split()))


rs.sort(key=lambda x: -x)
hp = []
hq = []
for p in ps:
    heappush(hp, p)
    if len(hp) > X:
        heappop(hp)

for q in qs:
    heappush(hq, q)
    if len(hq) > Y:
        heappop(hq)

for r in rs:
    if len(hq) < Y:
        heappush(hq, r)
    elif len(hp) < X:
        heappush(hp, r)
    elif hp[0] < hq[0]:
        heappush(hp, r)
        heappop(hp)
    else:
        heappush(hq, r)
        heappop(hq)

print(sum(hq) + sum(hp))

Submission status: Runtime Error

Solution code:
letters = eval(input("Enter: "))
for i in letters:
  print(["Yes" if (i[2]==i[3] and i[4]==i[5]) "Yes" if letters=="coffee-like" else "No"])

Submission status: Runtime Error

Solution code:
K,N=map(int,input().split())
A=list(map(int,input().split()))
A=sorted(A)
A.append(A[0]+K)
i=0
b=0
for i in range(N):
    if b<A[i+1]-A[i]:
        b=A[i+1]-A[i]
print(K-b)

Submission status: Runtime Error

Solution code:
letters = eval(input("Enter: "))
for i in letters:
  if i[2]==i[3] and i[4]==i[5]:
    print("Yes")
  elif letters=="coffee-like":
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

if (s[2] == s[3])and (s[4] == s[5])and (s[2] != s[4])and (s[0]!=s[1])and (s[0]!=s[2])ans(s[0]!=s[4]):
    ans = "Yes"

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S =input()
S =int(S)
a = 0
b =0

while S>=500:
  S -=500
  a +=1
  g =S-(500*a)
  while g>=5:
    g -=5
    b +=1
h =1000*a +5*b
print(h)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
k, n = map(int, input().split())
arr = list(map(int, input().split()))
ans = 0
for i in range(n):
    if i + 1 <= n - 1:
        if arr[i + 1] - arr[i] > ans:
            ans = arr[i + 1] - arr[i]
    else:
        if arr[i] - arr[0] > ans:
            ans = arr[i] - arr[0]
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
 
int main(void) {
    char S[6];
    cin >> S;
 
    if(S[2]==S[3] && S[4]==S[5]) cout << "Yes";
    else cout << "No";
 
    return 0;
}

Submission status: Runtime Error

Solution code:
S = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

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

Submission status: Runtime Error

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

if l[3] == l[4]:
    if l[5] == l[6]:
        print('Yes')

print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input()

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

Submission status: Runtime Error

Solution code:
n=int(input())
print(n//500 * 1000 + (n%500)//5 * 5)

Submission status: Runtime Error

Solution code:

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

Submission status: Runtime Error

Solution code:
def coffee():
    if len(S) == 6 and S[2]==S[3] and S[4]==S[5]:
        return 'Yes'

coffee()

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
text = list(S)
if text[2] == text[3]:
    if text[4]==text[5]:
        print('Yes')
    else:
        prinrt('No')
else:
    print('No')

Submission status: Runtime Error

Solution code:
letters = eval(input("Enter your words: "))
for i in letters:
  print(["Yes" if (i[2]==i[3] and i[4]==i[5]) else "NO" )

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=input();
ans =0
for n in set(i for i in s[2::]):
  if s.count(n)==2:
    ans+=1
print('Yes' if ans>1 else 'No'

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
text = list(input())
if text[2] == text[3]:
    if text[4]==text[5]:
        print('Yes')
    else:
        prinrt('No')
else:
    print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
if len(S) == 6 and S[2]==S[3] and S[4]==S[5]:
    print("Yes")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input()

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

else:
  print('No')

Submission status: Runtime Error

Solution code:
x=int(input())
cnt = 0
q = x // 500
cnt += (q * 1000)
w = x % 500
e = w // 5
cnt += (e * 5)
print(cnt)

Submission status: Runtime Error

Solution code:
total, N = map(int, input().split())
nums = list(map(int, input().split()))
if N == 1:
    print(0)
else:
    ans = total - (total - nums[-1] + nums[0])
    prev = nums[0]
    for num in nums[1:]:
        ans = min(total-(num - prev), ans)
        prev = num
    print(ans)

Submission status: Runtime Error

Solution code:
letters = eval(input("Enter your words: "))
for i in letters:
  print(["Yes" if (i[2]==i[3] and i[4]==i[5]) else "NO" )

Submission status: Runtime Error

Solution code:
s = input()

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

Submission status: Runtime Error

Solution code:
S = list(input())

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

Submission status: Runtime Error

Solution code:
     #include <bits/stdc++.h>           
    using namespace std;
    #define ll long long
    #define ld long double
    #define inf 100000
    #define io  ios_base::sync_with_stdio(false); cin.tie(NULL); 
    int main()
    {
        io
        string n;
        cin>>n;
       
      if (n[2]==n[3] && n[4]==n[5])
      {
          cout<<"Yes"<<endl;
      }
      else
      {
          cout<<"No"<<endl;
      }
        }

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
letters = eval(input("Enter your words: "))
for i in letters:
  if i[2]==i[3] and i[4]==i[5]:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

int main() {
  string S;
  cin>>S;
  if(S.at(2)==S.at(3)){
    if(S.at(4)==S.at(5)){
      cout<<"Yes"<<endl;
    }
    else{
      cout<<"No"<<endl;
    }
  }
  else{
    cout<<"No"<<endl;
  }
}

Submission status: Runtime Error

Solution code:
str(a)=input()
split(a)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
"""
"""


def int_as_array(num): return list(map(int, [y for y in str(num)]))


def array_as_int(arr): return int(''.join(map(str, arr)))


def read_int(): return int(input())


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


def array_to_string(arr, sep=' '): return sep.join(map(str, arr))


def matrix_to_string(arr, sep=' '): return '[\n' + '\n'.join(
    [sep.join(map(str, row)) for row in arr]) + '\n]'


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


T = read_int()

string = input()
solve(string)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = str(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
letters = eval(input("Enter your words: "))
for i in letters:
  if (i[2]==i[3]) and (i[4]==i[5]:
      print("Yes")
  else:
      print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input()
if(S[4]==S[5] && S[6]==S[7]):
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

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

num_500 = int(X / 500)
num_5 = int((X - (num_500*500)) / 5)

print((num_500*1000) + (num_5)*5)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=input()

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

	print("Yes")else:

	print("No")

Submission status: Runtime Error

Solution code:
import sys,bisect
from math import gcd
input = sys.stdin.readline
 
############ ---- USER DEFINED INPUT FUNCTIONS ---- ############
def inp():
    return(int(input().rstrip()))
def inlt():
    return(list(map(int,input().rstrip().split())))
def insr():
    s = input().rstrip()
    return(s[:len(s) - 1])
def invr():
    return(map(int,input().rstrip().split()))
################################################################
s = input().strip()
if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
else:
    print('No')
#print()

Submission status: Runtime Error

Solution code:
S = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
 
#include<bits/stdc++.h>
using namespace std;
 
#define ff              first
#define ss              second
#define int             long long
#define pb              push_back
#define mp              make_pair
#define pii             pair<int,int>
#define vi              vector<int>
#define mii             map<int,int>
#define pqb             priority_queue<int>
#define pqs             priority_queue<int,vi,greater<int> >
#define setbits(x)      __builtin_popcountll(x)
#define zrobits(x)      __builtin_ctzll(x)
#define mod             1000000007
#define inf             1e18
#define ps(x,y)         cout<<setprecision(y)<<x
#define mk(arr,n,type)  type *arr=new type[n];
#define w(x)            int x; cin>>x; while(x--)
#define pw(b,p)         pow(b,p) + 0.1
#define endl            "\n"
mt19937                 rng(chrono::steady_clock::now().time_since_epoch().count());


void __print(int32_t x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
 
char myHeap[200 * 1024 * 1024];
int sz = 0;
void assert_tle(bool q) { while (!q); }
void* operator new  ( std::size_t count ) {
    sz += count;
    assert_tle(sz <= 200 * 1024 * 1024);
    return myHeap + sz - count;
}
 
void operator delete (void *ptr) { }
 
 
void fastIO()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
}


void solve()
{
    string str;

    cin>>str;

    if(str[2]==str[3]&&str[4]==str[5])
    {
        cout<<"Yes";
    }
    else
    {
        cout<<"No";
    }
}
 
 
int32_t main()
{
    fastIO();
    w(t)
    {
        solve();
        cout<<endl;
    }
    return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=input()
if(len(s)>6s=input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(ans)

Submission status: Runtime Error

Solution code:
X = int(input())
if n==17:
  print('YES')
  
else:
  print('NO')

Submission status: Runtime Error

Solution code:
S = input()

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

Submission status: Runtime Error

Solution code:
strings=input()


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

Submission status: Runtime Error

Solution code:
/*
 * FileName:     A
 * CreatedDate:  2020-03-28 20:59:35 +0900
 * LastModified: 2020-03-28 21:02:23 +0900
 */

#include <stdio.h>

int main(void){
    char S[6];
    scanf("%s",S);
    if(S[2]==S[3]){
        if(S[4]==S[5]){
            printf("Yes\n");
            return 0;
        }
    }
    printf("No\n");
    return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>

using namespace std;

int main(void) {
	cin.tie(nullptr); ios::sync_with_stdio(false);
	string coffee; cin >> coffee;

	if (
		coffee[2] == coffee[3] &&
		coffee[4] == coffee[5]
		) {
		cout << "Yes" << endl;
	else
		cout << "No" << endl;
	}

	return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys,bisect
from math import gcd
input = sys.stdin.readline

############ ---- USER DEFINED INPUT FUNCTIONS ---- ############
def inp():
    return(int(input().rstrip()))
def inlt():
    return(list(map(int,input().rstrip().split())))
def insr():
    s = input().rstrip()
    return(s[:len(s) - 1])
def invr():
    return(map(int,input().rstrip().split()))
################################################################
s = input().strip()
if s[2] == s[3] and s[4] == s[5]:
    print('Yes')
else:
    print('No')
#print()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
using namespace std;
#define For(i,m,n) for(int i=m;i<n;i++)
#define FOR(n) for(int i=0;i<n;i++)
#define ll long long
ll mob=1000000007;
using namespace std;
int main()
{ string s;
cin>>s;
if(s[2]==s[3]&&s[4]==s[5])
cout<<"Yes";
else cout<<"No";





return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

import sys


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


def resolve():
    k, x = map(int, input().split())

    sum_money = k * 500

    if sum_money >= x:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    resolve()

Submission status: Runtime Error

Solution code:
S = input()

def solve(S):
    if S[4] == S[5] and S[6] == S[7]:
        return "Yes"
    else:
        return "No"

print(solve(S))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#author : dokueki

import sys


def IOE():
    sys.stdin = open("input.txt", "r")
    sys.stdout = open("output.txt", "w")


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



if __name__ == "__main__":
    #IOE()
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;

int main(){
    string s;
    cin>>s;
    if(s[2]==s[3]){
        if(s[4]==s[5]){
            cout<<"Yes"<<endl;
            return 0;
        }
    }
    cout<<"No"<<endl;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def INT(): x = int(input()) return x
def LIST(): x = list(map(int, input().split())) return x

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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