403867: GYM101343 I Husam and the Broken Present 1

In his last birthday, Husam received a special present from his best friend, it was a beautiful array a consisting of n positive integers. Husam loved this present so much, so he used it to build another table t such that for each i and j (1  ≤  i, j  ≤  n) t_ij = a_i  ×  a_j.

Unfortunately, today Husam was looking for his array a, but he was not able to find it. Husam was very sad, so he asked you to help him. Husam does not remember anything about array a, but he will show you the table t. Can you help Husam to build the array a again?

The First line contains an integer n (1  ≤  n  ≤  100), where n is the size of the array a.

Next n lines follow, each line contains n positive integers (1  ≤  t_ij  ≤  10⁴), giving the table t.

In a single line print n positive integers a₁, a₂, ..., a_n – the array a.

It is guaranteed that there exists a unique answer for each test case. Your answer will consider correct if you can use the printed array a to build the given table t, such that for each i and j (1  ≤  i, j  ≤  n) t_i, j = a_i  ×  a_j.

3
9 6 15
6 4 10
15 10 25

3 2 5

5
16 28 8 36 4
28 49 14 63 7
8 14 4 18 2
36 63 18 81 9
4 7 2 9 1

4 7 2 9 1