#include "bits/stdc++.h"

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

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

map<int, int> factors;

void factorize(int n) {
    while (n % 2 == 0) {
        factors[2]++;
        n = n / 2;
    }
    for (int i = 3; i <= sqrt(n); i = i + 2) {
        while (n % i == 0) {
            factors[i]++;
            n = n / i;
        }
    }
    if (n > 2)
        factors[n]++;
}

signed main() {
    int a, b;
    cin >> a >> b;
    factorize(a);
    bool flag1 = factors[a];
    factors.clear();
    factorize(b);
    bool flag2 = factors[b];
    if (flag1 and flag2 and a != b) {
        cout << "full credit";
    } else {
        factors.clear();
        factorize(a);
        factorize(b);
        bool flag = 0;
        for (auto i: factors)
            flag |= (i.second != 1);
        if (flag)
            cout << "no credit";
        else
            cout << "partial credit";
    }
}