Weird Algorithm

Next: missing-number

You are given a positive integer $n$.
If $n$ is even, set $n\leftarrow \frac{n}{2}$; if $n$ is odd, set $n\leftarrow 3n+1$.
Repeat this process until $n=1$.

For example, the sequence for $n=3$ is

$3\to 10\to 5\to 16\to 8\to 4\to 2\to 1.$

Your task is to print every value of $n$ that appears during the algorithm.

Input

The only input line contains an integer $n$.

Output

Print a single line containing all values of $n$ produced by the algorithm, separated by spaces.

Constraints

$1\le n\le 10^6$

Answer

This is the collatz conjecture.

#include <iostream>
 
int main() {
  long long n;
 
  std::cin >> n;
  std::cout << n << ' ';
  
  while (n > 1) {
    n = n % 2 == 0 ? n / 2 : (n * 3) + 1;
    std::cout << n << ' ';
  }
}

Next: missing-number