#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ld long double

ll qmul(ll a, ll b, ll m)
{
    a %= m;
    b %= m;
    ll r = a * b, s = (ld)a * b / m;
    return ((r - m * s) % m + m) % m;
}

ll qpow(ll a, ll b, ll m)
{
    ll res = 1;
    while (b)
    {
        if (b & 1)
            res = qmul(res, a, m);
        a = qmul(a, a, m);
        b >>= 1;
    }
    return res;
}

bool miller_rabin(ll n, ll base)
{
    ll n2 = n - 1;
    ll s = 0;
    while (n2 % 2 == 0)
        n2 /= 2, s++;

    ll t = qpow(base, n2, n);
    if (t == 1 || t == n - 1)
        return true;
    for (s--; s >= 0; s--)
    {
        if ((t = qmul(t, t, n)) == n - 1)
            return true;
    }
    return false;
}

bool isprime(ll n)
{
    static ll base[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37};
    if (n < 2)
        return false;
    for (int i = 0; i < 12 && base[i] < n; i++)
        if (!miller_rabin(n, base[i]))
            return false;
    return true;
}

int main()
{
    ll a, b;
    scanf("%lld%lld", &a, &b);
    if (__gcd(a, b) != 1)
    {
        puts("no credit");
        return 0;
    }
    for (ll i = 2; i < 1000010; i++)
    {
        if (a % (i * i) == 0 || b % (i * i) == 0)
        {
            puts("no credit");
            return 0;
        }
    }

    if (!isprime(a) || !isprime(b))
        puts("partial credit");
    else
        puts("full credit");
    return 0;
}