# Practice on Toph

Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.

Participate in exhilarating programming contests, solve unique algorithm and data structure challenges and be a part of an awesome community.

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 (a_{1}, a_{2}) choose the one which maximizes (a_{1} + a_{2}).

You have to print that maximum value of (a_{1} + a_{2}).

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 |

99% Solution Ratio

prodip_bsmrstuEarliest,

prodip_bsmrstuFastest, 0.0s

riadroxLightest, 0 B

mdvirusShortest, 15B

Login to submit

It is trivial that the answer would be simply $N+1$. You can also factorize $N$ and find the maximu...