Help is Needed for Dexter

Dexter is tired of Dee Dee, so he decided to keep Dee Dee busy in a game. The game he planned for her is quite easy to play but not easy to win, at least not for Dee Dee. But Dexter does not have time to spend on this silly task, so he wants your help.

There will be a button; when it is pushed, a random number N will be chosen by the computer, and the numbers from 1 to N will appear on the screen. Dee Dee can choose any number of numbers from the numbers on the screen, and then she will command the computer to subtract a positive number chosen by her (not necessarily on screen) from the selected numbers. Her objective is to make all the numbers 0.

For example, if N = 3, then there will be 3 numbers on the screen: 1, 2, 3. Say she now selects 1 and 2 and commands to subtract 1, then the numbers on the screen will be: 0, 1, 3. Then she selects 1 and 3 and commands to subtract 1. Now the numbers are 0, 0, 2. Then she subtracts 2 from 2, and all the numbers become 0.

Dexter is not so dumb to understand that this can be done very easily, so to make a twist, he will give a limit L of moves for each N, and surely L will be as small as possible so that it is still possible to win within L moves. But Dexter does not have time to think how to determine L for each N, so he asks you to write a code which will take N as input and give L as output.

Input Specification

The input consists of several lines, each containing N such that 1 ≤ N ≤ 1 000 000 000. The input will be terminated by end of file (EOF).

Output Specification

For each N, output L in a line by itself.

Sample Input

1. 1
2. 2
3. 3

download as text file

Output for Sample Input

1. 1
2. 2
3. 2

download as text file