#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;

#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()

int main() {
  ll n;
  while (cin >> n && n) {
    ll sum = 1;
    for (ll i = 2; i * i <= n; ++i) {
      if (n % i == 0) {
        sum += i;
        if (i != n / i) sum += n / i;
      }
    }
    if (n == 1) {
      cout << "deficient number" << endl;
    } else if (n == sum) {
      cout << "perfect number" << endl;
    } else if (n > sum) {
      cout << "deficient number" << endl;
    } else {
      cout << "abundant number" << endl;
    }
  }
  return 0;
}
