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

using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<long long>;
using vvi = vector<vi>;
using vs = vector<string>;
using vc = vector<char>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(a) (a).begin(), (a).end()
template<class T> using min_pq = priority_queue<T, vector<T>, greater<T>>;

const int INF = 1e9;
const ll LINF = 1e18;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll n;
    cin >> n;
    ll a,b,c,d,e,f;
    cin >> a >> b >> c >> d >> e >> f;
    ll kcsum=0;
    int kccy=0;
    while(true){
        kcsum+=b*(a+kccy*c);
        if(kcsum>=n) break;
        kccy++;
    }
    ll kusum=0;
    int kucy=0;
    while(true){
        kusum+=e*(d+kucy*f);
        if(kusum>=n) break;
        kucy++;
    }
    ll kcday=b*(kccy-1);
    ll kuday=e*(kucy-1);
    kusum-=e*(d+(kucy)*f);
    kcsum-=b*(a+(kccy)*c);
    rep(i,2*e){
        if(kusum>=n) break;
        if(i==e) kucy++;
        kusum+=d+kucy*f;
        kuday++;
    }
    rep(i,2*b){
        if(kcsum>=n) break;
        if(i==b) kccy++;
        kcsum+=a+kccy*c;
        kcday++;
    }
    if(kcday<kuday) cout << "KCPC" << endl;
    else if(kuday<kcday) cout << "KUPC" << endl;
    else cout << "Same" << endl;
    
    
}