#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>

#define EPS 1e-9
#define PI acos(-1.0)
#define ll long long
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
#define pb push_back
#define ft first
#define sc second
#define pi pair<ll,ll>
#define vi vector<ll>
#define sz(s) s.size()
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<ll, null_type, less<ll>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
const ll N = 2e5+5, M = 250, MOD = (1LL<<32), INF = 1e18;
int dx[] = {-1, 1, 0, 0}, Dx[] = {-1, -1, 0, 1, 1, 1, 0, -1};;
int dy[] = {0, 0, 1, -1}, Dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
ll n, m, t, a[N], p[N], sz[N];
vi g[N];
void init(){
    for(int i = 1; i <= n ;++i)
        p[i] = i,sz[i] = 1;
}
int findset(int s)
{
    if(s == p[s]) return s;
    return p[s] = findset(p[s]);
}
void join(int a,int b)
{
    a = findset(a);
    b = findset(b);
    if(sz[a] < sz[b]) swap(a,b);
    if(a != b)
    {
        p[b] = a;
        sz[a] += sz[b];
    }
}
int main()
{
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);//freopen("lines.in", "r", stdin);
    cin >> n >> m;
    int tmm = 1,tmm2 = 1, no = 0;
    if(n == m) return cout << "no credit",0;
    for(ll i = 2; i * i <= n ;++i)
    {
        if(n%i == 0) tmm = 0;
        if(n%(i*i) == 0) no = 1;
    }
    for(ll i = 2; i * i <= m ;++i)
    {
        if(m%i == 0) tmm2 = 0;
        if(m%(i*i) == 0) no = 1;
    }
    if(tmm && tmm2 && !no) cout << "full credit";
    else if(no) cout << "no credit";
    else cout << "partial credit";
    return 0;
}
/*

*/