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):
S = input()

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



from math import gcd
from itertools import combinations,permutations,accumulate, product 

from collections import deque,defaultdict,Counter
import decimal
import re
import math
import bisect
import heapq














import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7


INF = float('inf')
from sys import stdin
readline = stdin.readline
def readInts():
  return list(map(int,readline().split()))
def readTuples():
    return tuple(map(int,readline().split()))
def I():
    return int(readline())
s = input()
if s.startswith("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("Yes" if input()[:4] == "YAKI" else "No")

Solution (Python):
S = input()

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

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

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

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

Solution (Python):
a = input()

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

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

Solution (Python):
def main():
    s = input()

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


if __name__ == "__main__":
    main()

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

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

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

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()
if len(s) >= 4:
    if s[:4] == "YAKI":
        print("Yes")
    else:
        print("No")
        
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 len(s) <= 3 or s[:4] != "YAKI":
    print("No")
else:
    print("Yes")

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

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

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

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

Solution (Python):
'''
Created on 2020/08/20

@author: harurun
'''
def main():
  import re
  import sys
  pin=sys.stdin.readline
  pout=sys.stdout.write
  perr=sys.stderr.write
  
  S=pin()[:-1]
  if re.fullmatch(r"YAKI[A-Z]*",S)==None:
    print("No")
    return 
  print("Yes")
  return 

main()

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

Solution (Python):


def main():
    s = input()
    if len(s) >= 4:
        if s[0:4] == "YAKI":
            print("Yes")
            return
    print("No")


if __name__ == '__main__':
    main()

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    S = SS()

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

if __name__ == '__main__':
    resolve()

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


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


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
n = input()

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

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

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

Solution (Python):
s = input()

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

Solution (Python):
x = input()
if len(x) <= 3:
  print("No")
elif x[:4] == "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):
s = input()
if s[:4] == 'YAKI':
  print('Yes')
else:
  print('No')

Solution (Python):
def main():
    s=input()
    a=s.find('YAKI')
    if(a!=0):
        print('No')
    else:
        print('Yes')

main()

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

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

Solution (Python):


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

def main():
    mod=10**9+7
    s=input()
    if s[:4]=="YAKI":
        print("Yes")
    else:
        print("No")

main()

Solution (Python):
s = input()

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

Solution (Python):
s = list(input())
n = len(s)
t = list("YAKI")
for i in range(4):
    if not s[i % n] == t[i]:
        print("No")
        exit()
print("Yes")

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() + 'XXXXXXXXXXXXXXXX'

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

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

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

Solution (Python):
s=str(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):
s = input()
s1 = s[0:4]
if s1 == "YAKI":
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
ans = 0
inf = float("inf")

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

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

Solution (Python):
S = input()
if len(S) <= 3:
  print("No")
  exit()
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().startswith("YAKI") else "No")

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

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

Solution (Python):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right 
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

s = input()
n = len(s)
if n >= 4:
    if s[:4] == 'YAKI':
        print('Yes')
        quit()
print('No')

Solution (Python):
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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):
s = input()
if len(s) >= 4:
    print("Yes" if s == "YAKI" or s[:4] == "YAKI" else "No")
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().strip()
if S[:4]=="YAKI":
    print("Yes")
else:
    print("No")

Solution (Python):
import re;print('YNeos'[not bool(re.fullmatch(r'^YAKI.*',input()))::2])

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

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

Solution (Python):
s=input()

chk=s[:4]

if chk=='YAKI':
    print('Yes')

else:
    print('No')

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

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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7


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

Solution (Python):
S = input()
print('Yes') if len(S) >= 4 and S[:4] == 'YAKI' 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):
s = input()
if s.startswith('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:
    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):
s=input()
if s[:4] == "YAKI":
  print("Yes")
else:
  print("No")

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

S = input()

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

Solution (Python):
s = input()

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    s = input()

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


if __name__ == '__main__':
    resolve()

Solution (Python):
s = 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):
import sys

sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7


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


def main():
    S = input()

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


if __name__ == "__main__":
    main()

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

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

Solution (Python):
s = input()
l = len(s)
if l <= 3:
    print("No")
else:
    if 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):
S=input()
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 "YAKI" in S[:4]:
    print("Yes")
else:
    print("No")

Solution (Python):
from sys import stdin
import math
import re
import queue

input = stdin.readline

MOD = 1000000007

def solve():
    S = (input().rstrip())
    if len(S) < 4:
        print("No")
        return
    if(S[:4] == "YAKI"):
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    solve()

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

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

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

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

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    S = input().rstrip()

    if S.find("YAKI") == 0:
        ans = "Yes"
    else:
        ans = "No"

    print(ans)


if __name__ == "__main__":
    main()

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

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

Solution (Python):
S = list(input())
if len(S)>3:
    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")
else:
    print("No")

Solution (Python):
if input()[: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()
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()
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):
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):
import sys
def input(): return sys.stdin.readline().strip()

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

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

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()
s_len = len(s)
if s_len < 4:
    print("No")
else:
    if s[0: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('YNeos'[input()[:4]!='YAKI'::2])

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

Solution (Python):
O = input()

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

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

Solution (Python):
s = input()

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

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

Solution (Python):
s = input() 

ind = s.find('YAKI')
if ind ==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):
import sys
input = sys.stdin.readline


if input().startswith('YAKI'):
	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()

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

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

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

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

    else:
        print('No')
resolve()

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

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

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    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
    

    
    

    s = input().rstrip()
    if len(s)<4:
        print('No')
    else:
        if 'YAKI'==s[:4]:
            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 = input()

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

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

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

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

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

Solution (Python):
s = list(input())
if s[:4] == ["Y", "A", "K", "I"]:
    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':
    ans='Yes'
else:
    ans='No'
print(ans)

Solution (Python):
S = input()
if len(S) >= 4 and 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) >= 4 and s[:4] == "YAKI":
    print("Yes")
else:
    print("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 S[:4] == "YAKI": print("Yes")
else:print("No")

Solution (Python):
S = input()
if len(S)<4:
  print("No")
else:
  if S[0:4] == "YAKI":
    print("Yes")
  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):
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")

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

Solution (Python):
s=input()
print("No" if len(s)<4 else ("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 len(s) < 4:
    print('No')    
elif s[:4] == 'YAKI':
    print('Yes')
else:
    print('No')

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

Solution (Python):

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


def solve():
    s = S() + "AAAAAAAAAAAAAAAA"
    if s[:4] == "YAKI":
        print("Yes")
    else:
        print("No")
    return



if __name__ == '__main__':
    solve()

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

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

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

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


if __name__ == '__main__':
    main()

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

Solution (Python):
S = input()

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

print(ans)

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

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

print(ans)

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

Solution (Python):



S = input()


s_len = len(S)


if s_len<4:
    print("No")
elif 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()
print('Yes' if s[:4]=='YAKI' else 'No')

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

if __name__ == "__main__":
    main()

Solution (Python):









import sys



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

Solution (Python):
s=input()
if s.startswith("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):
print('NYoe s'[input()[:4]=='YAKI'::2])

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

Solution (Python):
s = input()

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

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

Solution (Python):
s=input()
s_len=len(s)
if s_len<4:
    print("No")
elif 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()
print("YNeos"[S.find("YAKI")!=0::2])

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

Solution (Python):
s = input()

ans = 0

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

if (ans == 1):
    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):


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

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

Solution (Python):
from sys import stdin
S = stdin.readline().rstrip()
if S[:4] == '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 = 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()
if s[:4]=="YAKI":
  print("Yes")
else:
  print("No")

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

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

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

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

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

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

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

Solution (Python):
s=input()

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