#include <bits/stdc++.h>
using namespace std;
long long n, mp[2000][2000], a[100100];
int main() {
  scanf("%lld", &n);
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) scanf("%lld", &mp[i][j]);
  for (int i = 3; i <= n; ++i) {
    a[i] = sqrt((mp[i - 1][i] * mp[i - 2][i]) / mp[i - 2][i - 1]);
    a[i - 2] = mp[i - 2][i] / a[i];
    a[i - 1] = mp[i - 2][i - 1] / a[i - 2];
  }
  for (int i = 1; i <= n; ++i) printf("%lld ", a[i]);
  return 0;
}
