Collatz Peak

Difficulty: 1000 2000 ms 128 MB

math implementation

Following the same Collatz process to 1, print the LARGEST value the sequence ever reaches (including N itself).

Input: one integer N.

Output: the maximum value on the trajectory.

Constraints:

• 1 ≤ N ≤ 10⁶

Sample Tests

7

52

1

1

Read the Editorial