#include <cstdio>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll,int> P;
#define pb push_back
#define fi first
#define sec second
ll pow(ll a,int x)
{
	ll res = 1ll;
	while(x)
	{
		if(x&1)res*=a;
		a=a*a;
		x>>=1;
	}
	return res;
}
int main()
{
	while(1)
	{
		ll n,N;
		vector<P> fac;
		scanf("%lld",&n);
		if(n==0)break;
		N=n;
		for(ll i=2;i*i<=n;i++)
		{
			int cnt=0;
			while(n%i==0)
			{
				n/=i;
				cnt++;
			}
			if(cnt)fac.pb(P(i,cnt));
		}
		if(n!=1)fac.pb(P(n,1));
		ll S=1;
		for(int i=0;i<fac.size();i++)S *= (pow(fac[i].fi,fac[i].sec+1)-1)/(fac[i].fi-1);
		if(2*N==S)printf("perfect number\n");
		else if(2*N>S)printf("deficient number\n");
		else printf("abundant number\n");
	}
	return 0;
}