#include <bits/stdc++.h>
using namespace std;
const int N = 1 << 10;
unsigned long long a[N][N];
unsigned long long b[N];
void solve() {
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i)
    for (int j = 0; j < n; ++j) cin >> a[i][j];
  if (n < 2) {
    b[0] = 1;
    b[1] = a[0][1];
  } else {
    for (int i = 1; i < n - 1; ++i) {
      b[i] = sqrt(a[i - 1][i] * a[i][i + 1] / a[i - 1][i + 1]);
    }
    b[0] = a[0][1] / b[1];
    b[n - 1] = a[n - 2][n - 1] / b[n - 2];
  }
  for (int i = 0; i < n; ++i) cout << b[i] << " ";
}
void pre_calc() {}
int main() {
  pre_calc();
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int tst = 1;
  if (tst != 1) cin >> tst;
  while (tst--) solve();
}
