fb pixel

Algorithms and Data Structures

  • Profound Academy

    • Status
      • 1
        Implementation
      • 2
        Bitwise operations
      • 3
        Prefix Sums
      • 4
        Sliding window / Two pointers
      • 5
        Modular Arithmetic
      • 6
        Number Theory
      • 7
        Binary Search
      • 8
        Basic Sorting
      • 9
        Greedy Algorithms

  • Perfect number

    A number is considered perfect if it’s the sum of all its divisors except itself. For instance, the divisors of 6 are 1, 2, and 3, we exclude 6. 1 + 2 + 3 = 6 ⇒ 6 is a perfect number.

    Input

    The input contains a single integer n (1 ≤ n ≤ ).

    Output

    The program should print Yes if the given number is perfect and No otherwise.

    Examples

    Input
    Output
    6
    Yes
    8
    No

    Explanation

    1. 6 → 1 + 2 + 3 = 6 ⇒ 6 is perfect
    1. 8 → 1 + 2 + 4 = 7 ⇒ 8 is not perfect
     
    To check your solution you need to sign in
    Sign in to continue