Collatz Beauty#12259
Sign in

Collatz Beauty

1 second
256 megabytes
Very easy

For some integer , we define the beauty of its Collatz sequence by the number of division operations in the sequence.

The Collatz sequence is defined as follows:

Input

The first line contains single integer (1 \le t \le 1000) – the number of test cases.

The only line of each test case contains single integer (1 \le n \le 10^4) – the integer of the sequence.

Output

For each test case output the beauty of the sequence starting with .

Examples

Example 1

Loading
Loading

Note

In the first test case : n=10 has division operations in the sequence.

10 {\xrightarrow{\div 2}} 5 \xrightarrow{\times 3+1} 16 {\xrightarrow{\div 2}} 8{\xrightarrow{\div 2}} 4 {\xrightarrow{\div 2}} 2 {\xrightarrow{\div 2}} 1

In the second test case n=5 has division operations in the sequence.

5 \xrightarrow{\times 3+1} 16 {\xrightarrow{\div 2}} 8 {\xrightarrow{\div 2}} 4 {\xrightarrow{\div 2}} 2 {\xrightarrow{\div 2}} 1

Scoring

  1. Subtask ( points) : No additional constraints.