#include <bits/stdc++.h>

typedef long double ld;
typedef long long ll;
using namespace std;
int di[] = {1, 0, -1, -1, 0, 1, -1, 1};
int dj[] = {1, 1, 0, -1, -1, 0, 1, -1};
const ll oo = 1e18, MOD = 998244353;
const int N = 1e6 + 5, M = 350;
const ld PI = acos(-1.0), EPS = 1e-9;

//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

map<ll, int> mp;

//#define endl '\n'
int main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    //freopen("farm.in", "r", stdin);
    //memset(dp, -1, sizeof dp);
    ll a, b;
    cin >> a >> b;
    ll tmp1 = a;
    for (ll i = 2; i * i <= a; i++) {
        while (tmp1 % i == 0) tmp1 /= i, mp[i]++;
    }
    if (tmp1 > 1) mp[tmp1]++;
    ll tmp2 = b;
    for (ll i = 2; i * i <= b; i++) {
        while (tmp2 % i == 0) tmp2 /= i, mp[i]++;
    }
    if (tmp2 > 1) mp[tmp2]++;
    bool no = 0;
    for (auto x:mp) no |= (x.second > 1);
    cout << ((tmp1 == a && tmp2 == b && a != b) ? "full credit" : no ? "no credit" : "partial credit");
    return 0;
}