#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (int i = (int)(s - 1); i >= (int)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
T chmax(T& a, const U& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T, typename U>
T chmin(T& a, const U& b) {
    if (a <= b) return false;
    a = b;
    return true;
}

void yes_no(bool f, string yes = "Yes", string no = "No") { cout << (f ? yes : no) << "\n"; }

void solve() {
    ll n;
    cin >> n;
    vector<vl> v(2, vl(3));
    rep(i, 2) rep(j, 3) cin >> v[i][j];
    auto f = [&](vl v) -> ll {
        ll x = v[0], y = v[1], z = v[2];
        using lint = __int128_t;
        ll ng = 0, ok = n;
        while (ok - ng > 1) {
            ll mid = (ng + ok) / 2;
            lint a = (lint)x * mid;
            lint b = mid / y;
            lint c = mid % y;
            if (b > 0) {
                a += (b - 1) * b / 2 * y * z;
                a += c * z * b;
            }
            if (a >= n) ok = mid;
            else ng = mid;
        }
        return ok;
    };
    ll kcpc = f(v[0]);
    ll kupc = f(v[1]);
    if (kcpc < kupc) cout << "KCPC" << '\n';
    else if (kcpc > kupc) cout << "KUPC" << '\n';
    else cout << "Same" << '\n';
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    rep(ti, t) solve();
    return 0;
}