#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,a,b) for(ll i=a-1;i>=b;i--)
#define ll long long
#define ull unsigned ll
#define ld long double
#define bl __int128_t
#define fi first
#define se second
#define vel vector<ll>
#define vvel vector<vel>
#define pll pair<ll,ll>
#define vepll vector<pll>
#define vvepll vector<vepll>
#define ves vector<string>
#define vem vector<mint>
#define vvem vector<vem>
#define pmm pair<mint,mint>
#define bl __int128_t
#define cleout(i) cout<<fixed<<setprecision(i)
template<class T>using PQ=priority_queue<T,vector<T>,greater<T>>;
//               上  右 下 左
vector<int> di={-1, 0, 1, 0};
vector<int> dj={ 0, 1, 0,-1};

vector<int> dx={ 0, 1, 0,-1};
vector<int> dy={ 1, 0,-1, 0};


vector<int> ddx={ 1, 1, 1, 0, -1, -1, -1, 0 };
vector<int> ddy={ 1, 0, -1, -1, -1, 0, 1, 1 };

ll inf=1000000000000000000;//1e18
// LLONG_MAX

mt19937_64 rng((ull)chrono::steady_clock::now().time_since_epoch().count());

//[x^M]1/(1-x)^N=comb(N-1+M,M)

ll cal(ll a,ll b,ll c,ll N){
    ll ng=0;
    ll ok=10000000000000000;
    while(ok-ng>1){
        bl mid=(ok+ng)/2;
        bl t=mid/b;
        //a*b+(a+c)*b+...+(a+c*(t-1))*b+(a+c*t)*(mid%b)
        //a*mid+(0+cb+2cb+...+(t-1)cb)+ct*(mid%b)
        bl cnt=(bl)a*mid+(bl)t*(t-1)/2*c*b+(bl)c*t*(mid%b);
        if(N<=cnt)ok=mid;
        else ng=mid;
    }
    return ok;
}

void _solve(){
    ll N;
    cin>>N;
    ll a,b,c,d,e,f;
    cin>>a>>b>>c;
    cin>>d>>e>>f;
    ll x=cal(a,b,c,N);
    ll y=cal(d,e,f,N);
    if(x<y){
        cout<<"KCPC\n";
    }else if(x==y){
        cout<<"Same\n";
    }else{
        cout<<"KUPC\n";
    }
}


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

    
    ll _;
    bool multitest=0;
    if(multitest)cin>>_;
    else _=1;
    rep(__,0,_){
        _solve();
    }
}