1068.CSES - Weird Algorithm

1068.CSES - Weird Algorithm

Consider an algorithm that takes as input a positive integer nn. If nn is even, the algorithm divides it by two, and if nn is odd, the algorithm multiplies it by three and adds one. The algorithm repeats this, until nn is one. For example, the sequence for n=3n=3 is as follows:

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

Your task is to simulate the execution of the algorithm for a given value of nn.

Input

The only input line contains an integer nn.

Output

Print a line that contains all values of nn during the algorithm.

Constraints

• $1\le n\le 10^6$

Example

Input:
3

Output:
3 10 5 16 8 4 2 1

思路

熟悉常见输入输出

题解

use std::io::{BufRead, BufReader};
fn main() {
    let mut input = BufReader::new(std::io::stdin());
    let mut line = "".to_string();
    input.read_line(&mut line).unwrap();
    let mut split = line.split_whitespace();
    let mut num: u64 = split.next().unwrap().parse().unwrap();
    print!("{}", num);
 
    while num != 1 {
        if num % 2 == 0 {
            num /= 2;
        } else {
            num = (num * 3) + 1;
        }
 
        print!(" {}", num);
    }
}