Time limit: 1 second Memory limit: 64 megabytes ---------- After eating the watermelons, Marcelo went to the "Dreamy Summers" festival to get one step closer to making his summer dreamy! At the festival, Marcelo started selling pancakes. Initially, he had $n$ pancakes that he wanted to sell. Also, $n$ hungry customers were waiting to buy the pancakes. Marcelo, wanting to maximize customer satisfaction, decided to choose a number of customers and sell them **an equal number** of pancakes, which must be **more than one**, receiving one coin from each person in return. Furthermore, since Marcelo dislikes waste, he decided to sell all $n$ pancakes. Since Marcelo needs money to build his dreamy summer, he asks you to tell him the maximum number of coins he can receive while adhering to the above conditions. # Input The input consists of a single line containing the number $n$. $$2 \le n \le 1,000$$ # Output Output the maximum profit (or number of coins) Marcelo can earn from selling the pancakes on a single line. # Example ## Sample Input 1 ``` 6 ``` ## Sample Output 1 ``` 3 ``` Marcelo can choose three customers and sell two pancakes to each, thus receiving three coins. ## Sample Input 2 ``` 5 ``` ## Sample Output 2 ``` 1 ``` Marcelo can choose one customer and sell five pancakes to him, thus receiving one coin.