import java.io.*;

// Perfect Numbers Programming Problem
// Input: A positive integer
// Output: A message stating whether the number is perfect, abundant,
// or deficient.

// The program continues to prompt for input until a nonpositive integer 
// is provided as input.

public class PerfNum
{

  public static void main( String[] args ) throws Exception
  {
    BufferedReader br = new BufferedReader(
                        new InputStreamReader( System.in ) );
    int n, s;
    while( true )
    {
      System.out.print( "Enter an integer (0 to quit): " );
      n = Integer.parseInt( br.readLine() );
      if( n < 1 ) break;

      s = sumDiv(n);
      if( s < n )
        System.out.println( n + " is deficient." );
      else if( s > n )
        System.out.println( n + " is abundant." );
      else
        System.out.println( n + " is perfect." );
    }
    System.out.println( "Goodbye!" );
  }

  // computes and returns the sum of the proper divisors of n
  // (assumes n is positive)
  // for example, if n=12, the return value is 1+2+3+4+6=16
  private static int sumDiv( int n )
  {
    int sum = 0;
    for( int i = 1; i < n; i++ )
      if( n%i == 0 )
        sum += i;

    return sum;
  }

}