URI Online Judge | 1709
# Shuffled Deck

**Timelimit: 1**

By Vinícius "Cabessa" Fernandes dos Santos Brazil

A card pack has an even number 2n of cards a_{1} , a_{2} , . . . , a_{2n} , all distinct (a_{1} < a_{2} < · · · < a_{2n} ). The pack is initially sorted, that is, the first card in the pack is a_{1} , the second is a_{2} , and so on, and
the last card in the pack is a_{2n}.

A handler then performs a shuffling procedure repeatedly. The shuffling consists of two steps:

- the pack is divided in the middle;
- the cards in the two halves are then interleaved so that if the original sequence at the begining of step 1 is x
_{1}, x_{2},. . . , x_{2n}, then at the end of step 2 the sequence of cards becomes x_{n+1}, x_{1}, x_{n+2}, x_{2}, . . . , x_{2n}, x_{n}.

Given the number of cards in the pack, write a program to determine how many times the shuffling

procedure must be executed so that the pack becomes sorted again.

The input contains several test cases. A test case consists of one line, which contains an even integer **P** (**2** ≤ **P** ≤ **2** x **10 ^{5}** ), where

For each test case in the input your program must produce a single line, containing a single integer, the minimum number of times the shuffling procedure must be executed so that the set becomes sorted again.

Sample Input | Sample Output |

6 |
3 |