You are given an integer N which can be represnted as the product of two positive integers.
$ N = a_1 * a_2 \; , \text{where } a_1, a_2 > 0$
It is guaranteed that there will be at least 1 such representation of N.
Among all the possible pairs of (a1, a2) choose the one which maximizes (a1 + a2).
You have to print that maximum value of (a1 + a2).
For example, you can represent 12 as following pairs: (1, 12) , (2, 6), (3, 4).
So, the answer for 12 would be 1+12 = 13.
You'll be given an integer N (1 ≤ N ≤ 100000).
Print a single integer representing the above mentioned answer.
Input | Output |
---|---|
12 | 13 |