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

template<typename T>
T ADD(T a, T b){
    T res;
    return __builtin_add_overflow(a, b, &res)? std::numeric_limits<T>::max() : res;
}
template<typename T>
T MUL(T a, T b){
    T res;
    return __builtin_mul_overflow(a, b, &res)? std::numeric_limits<T>::max() : res;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll n;
    cin >> n;
    vector<ll> a(3), b(3);
    for(auto &&v : a) cin >> v;
    for(auto &&v : b) cin >> v;
    auto f = [&](vector<ll> a){
        ll ng = 0, ok = n;
        while(ng + 1 < ok){
            ll mid = (ng + ok) / 2;
            ll up = (mid - 1) / a[1];
            ll sv = ADD(MUL(a[0], mid), MUL(MUL(a[2], a[1]), MUL(up, up - 1) / 2));
            sv = ADD(sv, MUL((mid - 1) % a[1], MUL(a[2], up)));
            (sv >= n ? ok : ng) = mid;
        }
        return ok;
    };
    ll v0 = f(a), v1 = f(b);
    if(v0 == v1) cout << "Same\n";
    else if(v0 < v1) cout << "KCPC\n";
    else cout << "KUPC\n";
}