import math
 
def check_perfect_number(n):
    if n < 2:
        print("Not Perfect Number")
        return
 
    sum_divisors = 1  # Start with 1 as it is always a proper divisor
    sqrt_n = int(math.sqrt(n))
 
    for i in range(2, sqrt_n + 1):
        if n % i == 0:
            sum_divisors += i
            if i != n // i and n // i != n:
                sum_divisors += n // i
 
    if sum_divisors == n:
        print("Perfect Number")
    else:
        print("Not Perfect Number")
 
if __name__ == "__main__":
    n = int(input())
    check_perfect_number(n)