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

Solution (Python):
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()

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

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

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log 
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()

Solution (Python):
s=input()

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

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

Solution (Python):


S = input()

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

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

Solution (Python):

 
import math
import itertools
import sys
import copy
 





S = str(input())

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

Solution (Python):
import sys

s = input()

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

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

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

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

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

Solution (Python):

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

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

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

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

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

Solution (Python):
S = input()

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

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

Solution (Python):


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

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

Solution (Python):
s = input()

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

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

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

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

Solution (Python):
S=input()

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

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

Solution (Python):
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()

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

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

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

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

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

Solution (Python):
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()

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

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

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

else:
    print('No')

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

Solution (Python):
print("Yes" if input().startswith("YAKI") else "No")

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

Solution (Python):

import sys
sys.setrecursionlimit(10000000)
INF = 1<<32

YES = "Yes"  
NO = "No"  

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)  
    solve(S)

if __name__ == '__main__':
    main()

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

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

Solution (Python):


s = input()

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

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

Solution (Python):

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

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

Solution (Python):
s = input()

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

Solution (Python):
S = input()

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

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

Solution (Python):

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

Solution (Python):
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')

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

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

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

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

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

Solution (Python):
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")

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

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

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

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

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

Solution (Python):
S = input()

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

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

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

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

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


if __name__ == "__main__":
    resolve()

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

Solution (Python):
s = input()

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

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

Solution (Python):
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()

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

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

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

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

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

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

Solution (Python):
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')

Solution (Python):
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()

Solution (Python):
S = input()

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

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

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

Solution (Python):
def main():

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

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

Solution (Python):
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)

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

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

Solution (Python):
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")

Solution (Python):
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")

Solution (Python):
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()

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

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

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

Solution (Python):
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')

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

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

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

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

Solution (Python):



import re

S = input()




content = S


pattern = '^YAKI'






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

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

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

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

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

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

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

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

Solution (Python):
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')

Solution (Python):
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')

Solution (Python):

s=input()

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

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

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

Solution (Python):
S = input()

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

Solution (Python):
S = input()

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

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

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

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

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

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

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

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

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(S: str):
    if S.startswith('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)  
    solve(S)


if __name__ == '__main__':
    main()

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

Solution (Python):
import sys, re
input = sys.stdin.readline
pattern = re.compile('YAKI')

m = pattern.match(input())
print('Yes' if m else 'No')

Solution (Python):
print(["Yes", "No"][not(input()[:4] == "YAKI")])

Solution (Python):
s = input()

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

Solution (Python):

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


if __name__ == "__main__":
    main()

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


if __name__ == "__main__":
    main()

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

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

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

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

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

Solution (Python):
import re
s = input()
if re.match("YAKI", s):
    print("Yes")
else:
    print("No")

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

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

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

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

Solution (Python):
string = str(input())
if string.find("YAKI", 0, 4) >= 0:
    print("Yes")
else:
    print("No")

Solution (Python):
import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")


S = sys.stdin.readline().rstrip()
if S.startswith('YAKI'):
    print('Yes')
else:
    print('No')

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

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

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

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

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

Solution (Python):

"""
A - Snuke's favorite YAKINIKU
https://atcoder.jp/contests/code-festival-2017-quala/tasks/code_festival_2017_quala_a

"""
import sys


def solve(S):
    if S.startswith('YAKI'):
        return 'Yes'
    return 'No'


def main(args):
    S = input()
    ans = solve(S)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

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

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

Solution (Python):
import re
print("Yes" if re.search("^YAKI,*", input()) else "No")

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

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

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

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

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

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

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

Solution (Python):
s=str(input())

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

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

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

Solution (Python):
s=list(input())
s.append("0")
YAKI=["Y","A","K","I"]
ans=1
for i in range(4):
  if s[i] != YAKI[i]:
    ans=0
    break
if ans == 1:
  print("Yes")
else:
  print("No")

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

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

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

Solution (Python):


import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

S=input()

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

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

Solution (Python):
import re
print("Yes" if re.search("^YAKI,*", input()) else "No")

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

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

Solution (Python):
S = [i for i in 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")

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

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

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

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

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

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

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

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

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

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

Solution (Python):
S = input()

ans = S[0:4] == "YAKI"

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

Solution (Python):
S = input()

t = 'YAKI'
tmp = 0
for i in range(len(S)):
    if S[i] == t[i]:
        flag = True
        tmp += 1
    else:
        flag = False
        break
        
    if tmp == 4:
        break
  
if tmp == 4 and flag == True:
    print('Yes')
    
else:
    print('No')

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

Solution (Python):
s=list(input())
print('Yes'if ''.join(s[:4])=='YAKI' else'No')

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

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

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

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

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

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

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

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

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

Solution (Python):
s=input()
a=False
if(len(s)>3):
  if(s[0:4]=="YAKI"):
    a=True
print("Yes" if a else "No")

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

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

Solution (Python):
S = input()

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

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

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

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

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

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

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

Solution (Python):
S = input()

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

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

Solution (Python):
import re

s = input()
pat = "YAKI"
m = re.match(pat, s)
if m:
	print("Yes")
else:
	print("No")

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

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

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

Solution (Python):
s = input()

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

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

Solution (Python):
s = input()

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

Solution (Python):
S = str(input().strip())
if S[:4] == 'YAKI':
    print('Yes')
else:
    print('No')

Solution (Python):
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")

Solution (Python):
S = input()

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

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

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

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

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

Solution (Python):
from sys import stdin

in_strings = lambda: stdin.readline()[:-1] 
in_int = lambda: int(stdin.readline()) 
in_intlist = lambda: list(map(int, stdin.readline().split())) 

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

Solution (Python):
s=input()
if len(s)<4 or s[0:4]!='YAKI':print('No')
else:print('Yes')

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

Solution (Python):
import re

str = input()

m = re.match("^YAKI",str)

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

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

Solution (Python):
S = input()
flag = False
if (len(S) < 4):
  flag = False
else:
  if (S[0] == 'Y' and S[1] == 'A' and S[2] == 'K' and S[3] == 'I'):
    flag = True
  
if flag:
  print('Yes')
else:
  print('No')

Solution (Python):
S = input()
print('Yes' if S.startswith('YAKI') else 'No')

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

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

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

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

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

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

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

Solution (Python):
a = input()
if len(a)<4:print('No')
else:
    if a[0:4] == 'YAKI':print('Yes')
    else:print('No')

Solution (Python):
s = raw_input()
print ['No', 'Yes'][s[0 : 4] == 'YAKI']

Solution (Python):
s = raw_input()
print ['No', 'Yes'][s[0 : 4] == 'YAKI']

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

Solution (Python):
print(['Yes','No'][input()[:4]!='YAKI'])

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

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

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

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

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

Solution (Python):
s=input()

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

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

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

Solution (Python):
S = input()

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

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

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

Solution (Python):
S = input().rstrip()
if 4 <= len(S) and S[:4] == 'YAKI':
  print('Yes')
else:
  print('No')

Solution (Python):





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

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

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