CF582A GCD Table

The GCD table $ G $ of size $ n×n $ for an array of positive integers $ a $ of length $ n $ is defined by formula Let us remind you that the greatest common divisor (GCD) of two positive integers $ x $ and $ y $ is the greatest integer that is divisor of both $ x $ and $ y $ , it is denoted as . For example, for array $ a={4,3,6,2} $ of length 4 the GCD table will look as follows: Given all the numbers of the GCD table $ G $ , restore array $ a $ .

The first line contains number $ n $ ( $ 1

In the single line print $ n $ positive integers — the elements of array $ a $ . If there are multiple possible solutions, you are allowed to print any of them.