from math import sqrt



def 			_SCREAMING_SNAKE_CASE						( __lowercase   :			int    )						->      Dict:





    """simple docstring"""

    __A         =	0
    for i in range(1			,				int(sqrt(a_    ) + 1    )    ):
        if n % i == 0 and i != sqrt(a_    ):
            total += i + n // i
        elif i == sqrt(a_    ):
            total += i
    return total - n



def 			_SCREAMING_SNAKE_CASE						( __lowercase   :			int = 1_0_0_0_0    )						->      Optional[int]:





    """simple docstring"""

    __A         =	sum(
        i
        for i in range(1			,				a_    )
        if sum_of_divisors(sum_of_divisors(a_    )    ) == i and sum_of_divisors(a_    ) != i    )
    return total


if __name__ == "__main__":
  print(solution(int(str(input()).strip())))












def 			_SCREAMING_SNAKE_CASE						( __lowercase   :			List[Any]			,				__lowercase   :			Dict			,				__lowercase   :			str    )						->      Dict:





    """simple docstring"""

    if n == 0:
        return 1

    elif n % 2 == 1:
        return (binary_exponentiation(__lowercase			,				n - 1			,				__lowercase    ) * a) % mod

    else:
        __A         =	binary_exponentiation(__lowercase			,				n / 2			,				__lowercase    )
        return (b * b) % mod


# a prime number
__a      :       Union[str, Any]				  =   701

__a      :       Dict				  =   1000000000
__a      :       Union[str, Any]				  =   10

# using binary exponentiation function, O(log(p)):
print((a / b) % p == (a * binary_exponentiation(b, p - 2, p)) % p)






print((a / b) % p == (a * b ** (p - 2)) % p)




