#### Navdeep and Afzal are attending the state chess championship. Suddenly, Afzal had a thought! He asked Navdeep, “If there are a total of ‘n’ players and assuming that only one winner is possible then what is gonna be the maximum number of games the winner may play given that the two players are allowed to play against each other only if the difference between the games played by them are not more than one?”

#### Navdeep is smart, he cracked it! Can you?

##### Input Format:

```
The first and only line of input contains an integers, that denotes n.
```

##### Constraints:

```
Time Limit: 1 second
2 <= n <= 10000
```

##### Output Format:

```
Print the result, as described in the task.
```

#### Sample Input 1:

```
3 (Total number of Players)
```

#### Sample Output 1:

```
2
```

#### Sample Input 2:

```
4
```

#### Sample Output 2:

```
2
```

the approach is not like 1 2 2 3 3 3 4 4 4 4…

basically, it follows this pattern

1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 4, 4 , 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8

Link ----> OEIS

and the solution they gave is :-