#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vll vector<ll>
#define FOR(i,n) for(int i=0;i<n;i++)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define f first
#define s second

const int MOD = (int)1e9+7;

bool isPrime(ll a){
    for(ll i=2;i*i<=a;i++){
        if(a%i==0) return false;     
    }
    return true;
}
const int N = 1e7+1;
int main()
{
    vector<bool> prime(N,true);
    prime[0] = prime[1] = false;
    vll P;
    for(int i=2;i<N;i++){
        if(!prime[i]) continue;
        P.push_back(i);
        for(int j=i*2;j<N;j+=i){
            prime[j] = false;
        }
    }
    ll a, b;
    cin>>a>>b;
    if(isPrime(a) && isPrime(b) && a!=b) cout<<"full credit\n";
    else{
        map<ll,int> mp;
        if(isPrime(a)) mp[a]++;
        else{
            for(ll x: P){
                while(a%x==0){
                    mp[x]++;
                    a/=x;
                }
            }
            if(a!=1){
                assert(isPrime(a));
                mp[a]++;
            }
        }
        if(isPrime(b)) mp[b]++;
        else{
            for(ll x: P){
                while(b%x==0){
                    mp[x]++;
                    b/=x;
                }
            }
            if(b!=1){
                assert(isPrime(b));
                mp[b]++;
            }
        }
        bool even = false;
        for(auto x: mp){
            if(x.s>=2) even = true;
        }
        if(even) cout<<"no credit\n";
        else cout<<"partial credit\n";
    }
    return 0;
}