#66Medium
Number and sum of divisors
Time: 1 s · Memory: 256 MB
- Working with numbers
Statement
You are given a natural number . Find the number and the sum of all its divisors (including and itself).
Input format
A single integer ().
Output format
A single line with two numbers: the number of divisors and their sum.
Examples
Input
12
Output
6 28
Input
1
Output
1 1
Note
It is enough to search for divisors up to (d * d <= n): for that is steps, while going up to would take — too slow. For every divisor found, also count its pair , but if (a perfect square), do not count it twice.
