n,a,b,c,d,e,f=map(int,open(0).read().split())
def g(a,b,c):
  def judge(x):
    i,j=x//b,x%b
    ret=a*x+b*c*(i-1)*i//2
    return ret>=n
  ok,ng=1<<60,0
  while abs(ok-ng)>1:
    mid=ok+ng>>1
    if judge(mid):
      ok=mid
    else:
      ng=mid
  return ok
r1=g(a,b,c)
r2=g(d,e,f)
if r1<r2:
  print('KCPC')
elif r1>r2:
  print('KUPC')
else:
  print('Same')