# Practice on Toph

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

## For Loop FTW

Limits: 1s, 1.0 GB

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 atleast 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$

### Input

You’ll be given an integer $N (1 < N \leq 100000)$

### Output

Print a single integer representing the above mentioned answer.

### Samples

InputOutput
12
13

Author
• #### flash_7

Tarango works NSUPS. He loves to play FIFA & travel with friends. When not solving problems, he spends most of his time day dreaming. And, he most definitely is not a "manga lover".
Discussion