The following book shows a compilation of more than 20 basic exercises for competitive programming, all of them are written in Python. In addition, desktop tests are added to observe the operation of each algorithm.

Hoping you can take knowledge of the pages of this book, my best wishes.

Jan Pol

Exercise 1

Write a program that reads a string S, and prints that line on the standard output in reverse, that is, flipped right-to-left.

Input

The only input has a string S.

Output

Print the string in reverse

Example

Input

1 2 3 hello

Output

olleh 3 2 1

Solution

One way to easily solve this task is to use a loop to print the characters from the last position to the first. This avoids the need to save the reverse list, just print each character.

The code for the solution written in Python is shown below.

1 l = input()

2 i = len(l)

3 while i > 0:

4 i = i - 1

5 print(l[i], end='')

6 print()

Desktop Testing

Doing a desktop testing, it is observed how in each iteration each character is added inversely.

Exercise 2

Given of input a positive integer n. If n is even, the algorithm divides it by two, and if n is odd, the algorithm multiplies it by three and adds one. The algorithm repeats this, until n is one. For example, the sequence for n=5 is as follows:

5→16→8→4→21

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

Input

The only input line contains an positive integer n.

Output

Print a line that contains all values of n separated with spaces.

Example

Input

5

Output

5 16 8 4 21

Solution

To solve this task, a cycle is used to verify that the number is not yet 1. Within the cycle it is checked if the