#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;

map<ll, int> primes;

void solve(ll x) {
    for (ll i = 2; i * i <= x; ++i) {
        if (x % i) continue;
        int &cnt = primes[i];
        for (; x % i == 0; x /= i, ++cnt);
    }
    if (x > 1) ++primes[x];
}

bool is_prime(ll x) {
    if (x < 2) return false;
    for (ll i = 2; i * i <= x; ++i)
        if (x % i == 0) return false;
    return true;
}

int main() {
    ios::sync_with_stdio(false); cout.tie(nullptr); cin.tie(nullptr);
    ll a, b;
    cin >> a >> b;
    if (is_prime(a) and is_prime(b)) {
        if (a == b) cout << "no credit\n";
        else cout << "full credit\n";
    } else {
        solve(a);
        solve(b);
        bool partial = true;
        for (const auto &p : primes)
            if (p.second > 1) {
                partial = false; break;
            }
        if (partial) cout << "partial";
        else cout << "no";
        cout << " credit\n";
    }
    return 0;
}