Algorithms and Data Structures

Multiply and divide

Let’s play a game. Given an initial integer x, there are only 2 possible operations to perform:
  • (which is only allowed if x is divisible by 3)
You are given n values which were obtained by randomly performing these operations on some initial integer x. You are asked to restore the order of operations and print the values obtained in the correct order of operations performed.


The first line of the input contains a single integer n (1 ≀ n ≀ 60).
The next line contains n space-separated integers that were obtained during the process. The integers do not exceed in absolute value.


The program should print n space-separated integers in the correct order.


8 12 32 16 24
12 24 8 16 32




Time limit: 0.2 seconds

Memory limit: 512 MB

Output limit: 1 MB

To check your solution you need to sign in
Sign in to continue