N = int(input())


def q(x, y, z):
    ok = 10**16
    ng = 0
    while ng + 1 < ok:
        mid = (ok + ng) // 2
        k = mid // y
        t = x * mid + mid % y * k * z + k * (k - 1) // 2 * y * z
        if t >= N:
            ok = mid
        else:
            ng = mid
    return ok


def naive(x, y, z):
    s = 0
    for i in range(1, 10**8):
        s += x + (i - 1) // y * z
        if s >= N:
            return i


A, B, C = map(int, input().split())
D, E, F = map(int, input().split())
s = q(A, B, C)
t = q(D, E, F)
if s < t:
    print("KCPC")
elif s > t:
    print("KUPC")
else:
    print("Same")