#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double ESP=1e-10;
using namespace std;
int main(){
  long long int in;
  while(cin>>in,in){
    long long int sum=0;
    double tmp=sqrt(in);
    int co;
    if(tmp-(int)tmp!=0.0)co=(int)tmp+1;
    else co=(int)tmp+2;
    loop(i,1,co)if(in%i==0){
      if(in!=i*i)sum+=in/i+i;
      else sum+=i;
    }
    sum-=in;
    if(sum==in)cout<<"perfect number"<<endl;
    else if(sum<in)cout<<"deficient number"<<endl;
    else cout<<"abundant number"<<endl;
  }


}