/*
     Hell, 'til I reach Hell, I ain't scared
     Mama checkin' in my bedroom, I ain't there
                                                */
    #include<bits/stdc++.h>
    #include <ext/pb_ds/assoc_container.hpp>
    #include <ext/pb_ds/tree_policy.hpp>
    using namespace __gnu_pbds;
    using namespace std;

    #define Major  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #define TxtIO   freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
    #define read(a,n) for(int i = 0 ; i<n ; i++) cin>>a[i];
    #define write(a) for(auto x : a) cout<<x<<" ";
    #define int long long
    #define pb push_back
    #define all(a)  a.begin(),a.end()
    #define el "\n"

    typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

    const int inf=4e18;

    int dx[]={1,0,-1,0,1,1,-1,-1};
    int dy[]={0,1,0,-1,1,-1,1,-1};

    const int mod=1e9+7;
    const int MAX =1e6+7;

   // ---------------------------Function----------------------------------//
     bool isPrime(int n)
        {
            if (n <= 1)
                return false;

            for (int i = 2; i * i <= n; i++)
            {
                if (n % i == 0)
                    return false;
            }
            return true;
        }
        int check (int n){
            int ok=0;
            for(int i=1;i<=sqrt(n);i++){
                 if(n%i==0){
                    if(n/i==i){
                        int here=sqrt(i);
                        if(i!=1&&(here*here)==i){
                            ok|=1;
                        }
                    }
                    else{
                        int f=i,s=n/i;
                        int here=sqrt(f);
                        if(f!=1&&(here*here)==f)ok|=1;
                        here=sqrt(s);
                        if(s!=1&&(here*here)==s)ok|=1;
                    }
                 }
            }
//            cout<<ok<<el;
            return ok;
        }
        int no(int f,int s){
            return (check(f)|check(s));
        }
    void TestCake(){
       int a,b;
       cin>>a>>b;
       if(isPrime(a)&&isPrime(b)&&a!=b){
        cout<<"full credit";
       }
       else{
          if(__gcd(a,b)==1 && !no(a,b)){
            cout<<"partial credit";
          }
          else{
            cout<<"no credit";
          }
       }
    }
    //------------------------------Main---------------------------//
    signed main(){
        Major
        int T = 1;
//        cin >> T;
        while(T--){
            TestCake();
        //       cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
        }
        return 0;
    }