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

#define all(v) v.begin(),v.end()
#define rall(v)v.rbegin(),v.rend()

using ll = long long;
using ull = unsigned long long;
#define iINF 2000000000
#define llINF 9000000000000000000ll
const int MOD9 = 998244353;
const int MOD1 = 1000000000 + 7;
const vector<int> dx = {0,1,0,-1} , dy = {1,0,-1,0};

//chmin , chmax
template<typename T>
bool chmin(T &a , T b){ if(a > b){a = b ; return 1;}return 0;}
template<typename T>
bool chmax(T &a , T b){ if(a < b){a = b ; return 1;}return 0;}

//io
template<typename T , typename F>
std::istream& operator>>(std::istream& is , pair<T,F> &p){
    is >> p.first >> p.second; return is;
}
template<typename T , typename F>
std::ostream& operator<<(std::ostream& os , const pair<T,F> &p){
    os << " [" << p.first << " , " << p.second << "] "; return os;
}

//vio
template<typename T>
void printv1(vector<T> &v){
    for(int i=0;i<(int)v.size()-1;i++) cout << v[i] << " ";
    cout << v.back() << "\n";
}
template<typename T>
void printv2(vector<T> & v){
    for(auto &vi : v) cout << vi << "\n";
}
template<typename T>
void printvv(vector<vector<T>> &vv){
    for(auto &vvi : vv) printv1(vvi);
}
template<typename T>
void printve1(vector<T> &v){
    for(int i=0;i<(int)v.size()-1;i++) cerr << v[i] << " ";
    cerr << v.back() << "\n";
}
template<typename T>
void printve2(vector<T> & v){
    for(auto &vi : v) cerr << vi << "\n";
}
template<typename T>
void printvve(vector<vector<T>> &vv){
    for(auto &vvi : vv) printve1(vvi);
}

template<typename T>
void vin(vector<T> &v){
    for(auto &vi : v) cin >> vi;
}
template<typename T>
void vvin(vector<vector<T>> &vv){
    for(auto &vvi : vv) vin(vvi);
}

#include <atcoder/all>
using namespace atcoder;

int main(){cin.tie(0);ios::sync_with_stdio(0);
    ll n;cin >> n;
    ll a,b,c,d,e,f;cin >> a >> b >> c >> d >> e >> f;
    
    ll sup = 0 , inf = 20000000000000000ll;
    while(abs(sup - inf) > 1){
        ll mid = (sup + inf) / 2ll;
        ll bset = mid / b;
        ll bmod = mid % b;
        ll earn = a * b * mid + b * c * bset * (bset - 1) / 2ll + (a + bset * c) * bmod;
        if(earn >= n) sup = mid;
        else inf = mid;
    }

    ll sa = sup;

    swap(a , d) , swap(b , e) , swap(c , f);

     sup = 0 , inf = 20000000000000000ll;
    while(abs(sup - inf) > 1){
        ll mid = (sup + inf) / 2ll;
        ll bset = mid / b;
        ll bmod = mid % b;
        ll earn = a * b * mid + b * c * bset * (bset - 1) / 2ll + (a + bset * c) * bmod;
        if(earn >= n) sup = mid;
        else inf = mid;
    }

    if(sa > sup) cout << "KUPC";
    else if(sa < sup) cout << "KCPC" << endl;
    else cout << "Same" << endl;
}