This problem is a programming version of Problem 14 from projecteuler.net
The following iterative sequence is defined for the set of positive integers:
Using the rule above and starting with 13, we generate the following sequence:
It can be seen that this sequence (starting at 13 and finishing at 1) contains 10 terms. Although it has not been proved yet (Collatz Problem), it is thought that all starting numbers finish at 1.
Which starting number, produces the longest chain? If many possible such numbers are there print the maximum one.
Note: Once the chain starts the terms are allowed to go above .
The first line contains an integer , i.e., number of test cases.
Next lines will contain an integers .
Print the values corresponding to each test case.
Collatz sequence for is,
containing steps and is the longest for