#include <bits/stdc++.h>
using namespace std;

long long f(int x, int y, int z, long long N) {
    long long l = 0, r = N + 10;
    while (r - l > 1) {
        long long m = (l + r) / 2;
        __int128 K = m / y;
        __int128 R = m % y;
        __int128 S = (K * x + K * (K - 1) / 2 * z) * y + (x + K * z) * R;
        if (S >= N) r = m;
        else l = m;
    }
    return r;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    long long N;
    cin >> N;
    assert(1 <= N && N <= 1'000'000);
    int A, B, C;
    cin >> A >> B >> C;
    int D, E, F;
    cin >> D >> E >> F;
    assert(1 <= min({A, B, C, D, E, F}) && max({A, B, C, D, E, F}) <= 1'000'000);
    auto KCPC = f(A, B, C, N);
    auto KUPC = f(D, E, F, N);
    if (KCPC < KUPC) cout << "KCPC" << endl;
    if (KCPC > KUPC) cout << "KUPC" << endl;
    if (KCPC == KUPC) cout << "Same" << endl;
    return 0;
}