Problem:


Score : 100 points

Problem Statement

Ringo is giving a present to Snuke.

Ringo has found out that Snuke loves yakiniku (a Japanese term meaning grilled meat. yaki: grilled, niku: meat). He supposes that Snuke likes grilled things starting with YAKI in Japanese, and does not like other things.

You are given a string S representing the Japanese name of Ringo's present to Snuke. Determine whether S starts with YAKI.

Constraints

1 \leq |S| \leq 10

S consists of uppercase English letters.

Input

Input is given from Standard Input in the following format:

S

Output

If S starts with YAKI, print Yes; otherwise, print No.

Sample Input 1

YAKINIKU

Sample Output 1

Yes

YAKINIKU starts with YAKI.

Sample Input 2

TAKOYAKI

Sample Output 2

No

TAKOYAKI (a Japanese snack. tako: octopus) does not start with YAKI.

Sample Input 3

YAK

Sample Output 3

No



Sample input:
YAKINIKU


Sample output:
Yes

Submission status: Accepted

Solution code:
S = input()
if S[0:4] == 'YAKI':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s = input()
if len(s) >=4 and s[:4] == "YAKI":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    s=input()
    if s[:4]=='YAKI':
        print('Yes')
    else:
        print('No')
resolve()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    
    s=str(input())
    print('Yes' if s[:4]=='YAKI' else 'No')
    
resolve()

Submission status: Accepted

Solution code:
s = input()
s_len = len(s)
if s_len < 4:
    print("No")
else:
    if s[0:4] == "YAKI":
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
s = input()
if len(s) >= 4:
  if s[:4] == 'YAKI':
    print('Yes')
  else:
    print('No')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
O = input()
#print(O[:4])
if O[:4] == "YAKI":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S = input()
if len(S) >= 4:
    if S[0:4] == 'YAKI':
        print('Yes')
        exit()
print('No')

Submission status: Accepted

Solution code:
s = input()

if s[:4] == 'YAKI':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
s = list(str(input()))
if len(s)<4:
    print('No')
    sys.exit()
if s[0]=='Y' and s[1]=='A' and s[2]=='K' and s[3]=='I':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s = input() #sys.stdin.readlineは最後が改行

ind = s.find('YAKI')
if ind ==0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

# A - Snuke's favorite YAKINIKU
if input().startswith('YAKI'):
	print('Yes')
else:
	print('No')

Submission status: Accepted

Solution code:
S=input()
print('Yes' if len(S)>=4 and S[:4]=='YAKI' else 'No')

Submission status: Accepted

Solution code:
s = input()

if s[:4] == 'YAKI':
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
S=input()[:4];print('YNeos'[S!='YAKI'::2])

Submission status: Accepted

Solution code:
print("YNeos"["YAKI"!=input()[:4]::2])

Submission status: Accepted

Solution code:
def resolve():
    s=input()
    if s[0:4]=='YAKI':
        print('Yes')

    else:
        print('No')
resolve()

Submission status: Accepted

Solution code:
def resolve():
    s=input()
    if len(s)>=4 and s[0]=='Y' and s[1]=='A' and s[2]=='K' and s[3]=='I':
        print('Yes')
    else:
        print('No')
resolve()

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

s = read().rstrip().decode()
print('Yes' if 'YAKI' == s[:4] else 'No')

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

    s = input().rstrip()
    if len(s)<4:
        print('No')
    else:
        if 'YAKI'==s[:4]:
            print('Yes')
        else:
            print('No')

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

if S.startswith('YAKI'):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s = input()
print('Yes' if s[0:4] == 'YAKI' else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(["No","Yes"][input().startswith("YAKI")])

Submission status: Accepted

Solution code:
s = list(input())
if s[:4] == ["Y", "A", "K", "I"]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S = input()

if S[:4] == 'YAKI':
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S = input()
if S[:4]=='YAKI':
    ans='Yes'
else:
    ans='No'
print(ans)

Submission status: Accepted

Solution code:
S = input()
if len(S) >= 4 and S[:4] == 'YAKI':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s=input()
if(len(s)>=4 and s[:4]=="YAKI"):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s = input()
if len(s) >= 4 and s[:4] == "YAKI":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s=str(input())
if s[0:4]=='YAKI':
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
if len(S)<4:
  print("No")
else:
  if S[0:4] == "YAKI":
    print("Yes")
  else:
    print("No")

Submission status: Accepted

Solution code:
# CODE FESTIVAL 2017 予選 A: A – Snuke's favorite YAKINIKU
s = input()
print('Yes' if s[:4] == 'YAKI' else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

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


    if len(s)>=4 and  "YAKI" == s[:4]:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
if input()[:4] == "YAKI":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S = input()
if S[0:4] == "YAKI" :
    print("Yes")
else :
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
print("No" if len(s)<4 else ("Yes" if s[:4]=="YAKI" else "No"))

Submission status: Accepted

Solution code:
s = input()
if len(s) < 4:
    print('No')    
elif s[:4] == 'YAKI':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
if input()[:4] == 'YAKI':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, 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() + "AAAAAAAAAAAAAAAA"
    if s[:4] == "YAKI":
        print("Yes")
    else:
        print("No")
    return


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

Submission status: Accepted

Solution code:
if input()[:4] == 'YAKI':
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S = input()

if (S[0:4] == "YAKI"):
    print('Yes')
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

if len(S) < 4:
  print("No")
else:
  if S[:4] == "YAKI":
    print("Yes")
  else:
    print("No")

Submission status: Accepted

Solution code:
S = input()
if S[0:4] == 'YAKI':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
S = input()
if len(S) < 4:
    ans = "No"
else:
    if S[0:4] == "YAKI":
        ans = "Yes"
    else:
        ans = "No"
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    word = input()
    print("Yes" if 4 <= len(word) and word[:4] == "YAKI" else "No")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
l = list(input())
if "".join(l[:4]) == "YAKI":
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
S = input()

if S[:4] == 'YAKI':
  ans = 'Yes'
else:
  ans = 'No'

print(ans)

Submission status: Accepted

Solution code:
s = input()

if s[0:4] == "YAKI":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s = input()

if s[:4] == "YAKI":
    ans = "Yes"
else:
    ans = "No"

print(ans)

Submission status: Accepted

Solution code:
x=input()
if x[:4]=='YAKI':
	print('Yes')
else:
	print('No')

Submission status: Accepted

Solution code:
# Snuke's favorite YAKINIKU

# input process
S = input()

# initialization
s_len = len(S)

# output process
if s_len<4:
    print("No")
elif S[:4]=="YAKI":
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    s = input().rstrip()
    if len(s) >= 4 and s[:4] == "YAKI":
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# import bisect
# from collections import Counter, defaultdict, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math

import sys

# import numpy as np

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)

def main():
    s = input()
    l = len(s)

    if l < 4:
        print('No')
    elif s[:4] == "YAKI":
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s=input()
if s.startswith("YAKI"):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
S=input()

if S[:4]=="YAKI":
    print("Yes")
else:
    print ("No")

Submission status: Accepted

Solution code:
print('Yes' if (input()+'***')[:4]=='YAKI' else 'No')

Submission status: Accepted

Solution code:
print('NYoe s'[input()[:4]=='YAKI'::2])

Submission status: Accepted

Solution code:
S = input()
flag = 0
k = "YAKI"
if len(S)<4:
    print("No")
    flag = 1
else:
    for i in range(4):
        if S[i] != k[i]:
            flag = 1
            print("No")
            break
if flag == 0:
    print("Yes")

Submission status: Accepted

Solution code:
s = input()

if s[:4] == 'YAKI':
	print('Yes')
else:
	print('No')

Submission status: Accepted

Solution code:
S=input();print('Yes') if S[:4]=='YAKI' else print('No')

Submission status: Accepted

Solution code:
s=input()
s_len=len(s)
if s_len<4:
    print("No")
elif s[:4]=="YAKI":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s = input()
if s[0:4] == 'YAKI':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
S = input()
print("YNeos"[S.find("YAKI")!=0::2])

Submission status: Accepted

Solution code:
S = input()
if len(S) < 4:
    print("No")
else:
    if S[:4] == "YAKI":
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
s = input()

ans = 0

if (len(s) >= 4):
    if (s[0:4] == "YAKI"):
        ans = 1

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

Submission status: Accepted

Solution code:
s = list(input())
if len(s) <= 3:
    print('No')
elif s[0] == 'Y'and s[1] == 'A' and s[2] == 'K' and s[3] == 'I':
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

print("Yes") if input()[:4] == "YAKI" else print("No")

Submission status: Accepted

Solution code:
S = input()
print("Yes" if "YAKI" in S and S[0 : 4] == "YAKI" else "No")

Submission status: Accepted

Solution code:
from sys import stdin
S = stdin.readline().rstrip()
if S[:4] == 'YAKI':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
if input()[:4] == "YAKI":print("Yes")
else: print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

if s[0:4] == "YAKI": print("Yes")
else: print("No")

Submission status: Accepted

Solution code:
print('YNeos'[input()[:4]!="YAKI"::2])

Submission status: Accepted

Solution code:
s = input()
ans = 'No'
if len(s)>=4 and s[:4]=='YAKI':
    ans ='Yes'
print(ans)

Submission status: Accepted

Solution code:
print("NYoe s"[input()[:4]=="YAKI"::2])

Submission status: Accepted

Solution code:
s = input()
if len(s) < 4:
    print("No")
else:
    print("Yes" if s[:4] == "YAKI" else "No")

Submission status: Accepted

Solution code:
s=input()

if len(s)>=4:
  if s[0:4]=="YAKI":
    print("Yes")
  else:
    print("No")
else:
  print("No")

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def my_round(a,dig=0):
    p = 10 ** dig
    return (a * p * 2 + 1) // 2 / p

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): #最小公倍数
    return a/gcd(a,b)*b

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): #素因数分解
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

def main():
    s = input()
    if len(s) < 4:
        print('No')
        return
    if s[0:4] == 'YAKI':
        print('Yes')
    else:
        print('No')
    return

if __name__=='__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s=input()
if('YAKI' == s[0:4]):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    print("YNeos"[ST()[:4]!="YAKI"::2])
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s=input()

if len(s)<4:print("No");exit()

if s[0:4]=="YAKI":
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

S = input()

ans = False
if len(S) >= 4:
    if S[:4] == 'YAKI':
        ans = True

print('Yes' if ans else 'No')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
#N = int(input())
S = str(input())

if S.startswith("YAKI") :
  print ("Yes")
else :
  print ("No")

Submission status: Accepted

Solution code:
import sys

s = input()

if len(s) < 4:
	print("No")
	sys.exit()

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

Submission status: Accepted

Solution code:
print('Yes' if input()[:4]=='YAKI' else 'No')

Submission status: Accepted

Solution code:
a = input()
if a.startswith('YAKI'):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
S = input()
if len(S) <= 3:
  print("No")
  exit()
print("Yes" if S[:4] == "YAKI" else "No")

Submission status: Accepted

Solution code:

def main():
    S = input()
    if len(S)<=3:
        print("No")
        exit()
    else:
        S = S[0:4]
        if S == "YAKI":
            print("Yes")
        else:
            print("No")
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
S=input()
if S[0:4]=='YAKI':
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

if (len(S) > 3 and S[:4] == "YAKI"):
  print ("Yes")
else:
  print ("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 2019/12/16

print('Yes' if input().startswith('YAKI') else 'No')

Submission status: Accepted

Solution code:
s=input()+"xxxxx"
if s[:4]=="YAKI":
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
s = input()

if len(s)<4:
	print('No')
	exit()

if s[:4]=='YAKI':
	print('Yes')
else:
	print('No')

Submission status: Accepted

Solution code:
s=input()
s=s[:4]

if s=='YAKI':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
S=input()

if len(S)>=4:
  if S[:4]=='YAKI':
    print('Yes')
    exit()
print('No')

Submission status: Accepted

Solution code:
S=input()
if len(S)<4:
    print("No")
elif S[:4]=="YAKI":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
def examA():
    S = SI()
    ans = "No"
    if S[:4]=="YAKI":
        ans = "Yes"
    print(ans)


import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

if __name__ == '__main__':
    examA()

Submission status: Accepted

Solution code:
s = input()
if len(s) >= 4:
  if s[:4] == 'YAKI':
    print("Yes")
  else:
    print("No")
else:
  print("No")

Submission status: Accepted

Solution code:
print('Yes' if input().startswith('YAKI') else 'No')

Submission status: Accepted

Solution code:
s = input()
len_s = len(s)
if len_s >= 4:
  if s[:4] == "YAKI":
    print("Yes")
  else:
    print("No")
else:
  print("No")

Submission status: Accepted

Solution code:
inp = input()
if len(inp) < 4:
  print("No")
else:
  if inp[:4] == "YAKI":
    print("Yes")
  else:
    print("No")

Submission status: Accepted

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    s = str(readline().rstrip().decode('utf-8'))
    print("Yes" if s[:4] == "YAKI" else "No")


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
S = str(input())
if len(S) < 4:
    print('No')
    
elif S[:4] == 'YAKI':
    print('Yes')

else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s =input()
if s.find("YAKI") == 0:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32

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

def solve(S: str):
    if S[0:4] == 'YAKI':
        print(YES)
    else:
        print(NO)

    return



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

Submission status: Accepted

Solution code:
#coding:utf-8

s = input()

if s[:4] == 'YAKI':
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
#Snuke's favorite YAKINIKU
S = input()
if S[0:4] == "YAKI":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
print(("No","Yes")[input().find("YAKI")==0])

Submission status: Accepted

Solution code:
S = input()

if len(S) < 4:
    print('No')
elif S[:4] == 'YAKI':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s=input()
if len(s)<4:
    a=1
else:
    a=s[0]+ s[1]+ s[2]+ s[3]
if a=='YAKI':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s=list(input())
ans='No'
if len(s)>=4:
  if s[0]+s[1]+s[2]+s[3]=='YAKI':
    ans='Yes'
print(ans)

Submission status: Accepted

Solution code:
s = str(input())
if len(s) <= 3:
  print('No')
elif s[:4] == 'YAKI':
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
S=input()
T="YAKI"
ans=1
if(len(S)<4):
  ans=0
else:
  for i in range(4):
    if(S[i]!=T[i]):
      ans=0
if(ans):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
s=input()
if s[0:4]=="YAKI":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s=str(input())
print('Yes' if s[:4]=='YAKI' else 'No')

Submission status: Accepted

Solution code:
s = str(input())
if s[0:4] == 'YAKI':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
S = input()

if S[:4] == "YAKI":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S = input()
if len(S) < 4:
    print("No")
    exit(0)
if S[:4] == "YAKI":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S=raw_input()
print "Yes" if S[:4]=="YAKI" else "No"

Submission status: Accepted

Solution code:
def resolve():
    s = input()
    print("Yes" if s.startswith("YAKI") else "No")


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
s = input()

if len(s) >= 4 and s[:4] == "YAKI":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s=list(input())
if len(s)>=4 and s[0:4]==list('YAKI'):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    s = str(input().rstrip('\n'))
    print("Yes" if s[:4] == "YAKI" else "No")


if __name__ == '__main__':
    slove()

Submission status: Accepted

Solution code:
s = input()
if s[0:4] == "YAKI":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s=input()
print('Yes') if s[0:4]=='YAKI' else print('No')

Submission status: Accepted

Solution code:
S = input()
if S.startswith("YAKI"):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s = input()
if s[0:4] == 'YAKI':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s = input()
print('Yes' if len(s)>=4 and s[0]=='Y' and s[1]=='A' and s[2]=='K' and s[3]=='I' else 'No')

Submission status: Accepted

Solution code:
from sys import stdin

def readString() :
    return  stdin.readline().rstrip()

def solve() :
    S = readString()
    pos = S.find('YAKI')
    if(pos == 0) :
        print("Yes")
    else :
        print("No")
solve()

Submission status: Accepted

Solution code:
def main():

    S = input()
    if S[:4] == "YAKI":
        return "Yes"
    return "No"

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

Submission status: Accepted

Solution code:
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools


import queue
from collections import deque


def main():
    a = input()
    if a[:4] == 'YAKI':
        print('Yes')
    else:
        print('No')









if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=list(input())

if(len(s)>3 and s[0]=="Y" and s[1]=="A" and s[2]=="K" and s[3]=="I"):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s = input()
if len(s) >=4:
    if s[0] == 'Y' and s[1] == "A" and s[2] == "K" and s[3] == "I":
        print("Yes")
    else:
        print("No")
else:
    print("No")

Submission status: Accepted

Solution code:
print("Yes") if input()[:4] == "YAKI" else print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()
if len(a)<4:
    print('No')
else:
    if a[0]=='Y' and a[1]=='A' and a[2]=='K' and a[3]=='I':
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
s=input()
print('Yes' if s.startswith('YAKI') else 'No')

Submission status: Accepted

Solution code:
S = str(input())
if len(S)>=4:
    if S[0:4]=="YAKI":
        print("Yes")
        exit()
print("No")

Submission status: Accepted

Solution code:
if input()[0:4]=="YAKI":
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

import re

S = input()

# print(S)

# content = r'hellow python, 123, end.' 
content = S

# pattern = 'hel'
pattern = '^YAKI'

# result = re.match(pattern, content)

# print(result)


if re.match(pattern, content):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
def solve(s):
    return "Yes" if s.startswith("YAKI") else "No"
print(solve(input()))

Submission status: Accepted

Solution code:
import re
if re.match('YAKI',input()):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
if input()[:4] == 'YAKI':
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
import re
print("Yes" if re.match(r"YAKI.*?", input()) else "No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
s_list = []
ans = ['Y', 'A', 'K', 'I']
for i in s:
    s_list.append(i)
s_list = s_list[:4]
if s_list == ans:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
S = input()

if len(S)<4:
    print('No')
    sys.exit()


if S[0] == 'Y':
    if S[1] == 'A':
        if S[2] == 'K':
            if S[3] == 'I':
                print('Yes')
            else:
                print('No')
        else:
            print('No')
    else:
        print('No')
else:
    print('No')

Submission status: Accepted

Solution code:
# h,w=map(int,input().split())
s=input()

print('Yes' if s[:4] == 'YAKI' else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

if S[0:4]=="YAKI":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s=input()
l=len(s)
if(l<4):
  print("No")
elif(s[:4]=="YAKI"):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
s=input()
print("Yes" if len(s)>3 and s[:4]=="YAKI" else "No")

Submission status: Accepted

Solution code:
f = input()[:4] == 'YAKI'
print('Yes' if f else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
word = input().split('YAKI')
if word[0] == '':
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
N=input()
if N[0:4]=="YAKI": print("Yes")
else :print("No")