#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>
using namespace std;

typedef long long ll;
typedef long double ld;

const int N = 1e5+ 5;
const int OO = 1e9;

ll A, B;

map<ll, int> factorize(ll x) {
    map<ll, int> factors;
    for (ll i = 2; i * i <= x; ++i) {
        while (x % i == 0) {
            x /= i;
            ++factors[i];
        }
    }
    if (x > 1) {
        ++factors[x];
    }
    return factors;
}

bool isPrime(map<ll, int> &factors) {
    return factors.size() == 1 && factors.begin()->second == 1;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> A >> B;
    auto Afactors = factorize(A);
    auto Bfactors = factorize(B);
    if (isPrime(Afactors) && isPrime(Bfactors) && A != B) {
        cout << "full credit";
    } else {
        map<ll, int> factors;
        bool hasSquareFactor = false;
        for (auto &it : Afactors) {
            factors[it.first] = it.second;
            if (factors[it.first] > 1) {
                hasSquareFactor = true;
            }
        }
        for (auto &it : Bfactors) {
            factors[it.first] += it.second;
            if (factors[it.first] > 1) {
                hasSquareFactor = true;
            }
        }
        if (hasSquareFactor) {
            cout << "no credit";
        } else {
            cout << "partial credit";
        }
    }
    cout << endl;
    return 0;
}