The sum of different divisors#1139
Given a natural number , find the smallest natural number that cannot be represented as the sum of distinct natural divisors of .
The input consists of a single line containing the natural number , which does not exceed 2 \cdot 10^{18}.
Output the required number to the output file.
Example 1