#include <bits/stdc++.h>

#define N 1000005

using namespace std;

map<long long, int> d;
long long a, b;
int p[N], f[N];

void factor(long long x)
{
    for (int i = 1; i <= p[0] && x > 1; i++)
    {
        for (; !(x % p[i]); x /= p[i])
        {
            if (d.count(p[i]))
                ++d[p[i]];
            else
                d[p[i]] = 1;
        }
    }

    if (x > 1)
    {
        if (d.count(x))
            ++d[x];
        else
            d[x] = 1;
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    f[0] = f[1] = true;

    for (int i = 2; i < N; i++)
    {
        if (!f[i])
            p[++p[0]] = i;

        for (int j = 1; j <= p[0] && i * p[j] < N; j++)
        {
            f[i * p[j]] = true;
            if (!(i % p[j]))
                break;
        }
    }

    cin >> a >> b;
    factor(a);
    factor(b);

    if (max_element(d.begin(), d.end(), [](pair<long long, int> x, pair<long long, int> y)
                    { return x.second < y.second; })
            ->second >= 2)
        cout << "no credit\n";
    else if (d.size() == 2)
        cout << "full credit\n";
    else
        cout << "partial credit\n";

    return 0;
}