#include <bits/stdc++.h>

#define ll long long
#define ld  double
using namespace std;

const int N = 2e5 + 5, mod = 998244353;


bool isPrime(ll n) {
    for(ll i = 2; i * i <= n; i++) {
        if(n % i == 0) {
            return 0;
        }
    }
    return 1;
}

map<ll, int> get(ll n) {
    map<ll, int> ret;
    for(int i = 2; i * i <= n; i++) {
        while(n % i == 0) {
            ret[i]++;
            n /= i;
        }
    }
    if(n > 0) ret[n]++;
    return ret;
}



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


    ll a, b;
    cin >> a >> b;

    vector<string> s = {"full credit", "partial credit", "no credit"};

    if(isPrime(a) && isPrime(b)) {
        if(a == b) cout << s[2];
        else cout << s[0];
        return 0;
    }
    auto res = get(a);
    auto t = get(b);
    for(auto i: t) res[i.first] += i.second;

    bool found = 0;
    for(auto i: res) {
        if(i.second % 2 == 0) {
            found = 1;
        }
    }
    if(found) cout << s[2];
    else cout << s[1];

    return 0;
}