#include <bits/stdc++.h>
using namespace std;
long long fac[3000060];
void pre() {
  fac[0] = 1;
  for (int i = 1; i < 3000060; i++) fac[i] = fac[i - 1] * i % 1000000007;
}
long long powermod(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long nCrmod(long long n, long long r, long long p) {
  if (r == 0) return 1;
  return (fac[n] * powermod(fac[r], p - 2, p) % p *
          powermod(fac[n - r], p - 2, p) % p) %
         p;
}
void solve() {
  long long n;
  cin >> n;
  long long use[n][n];
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cin >> use[i][j];
    }
  }
  for (int i = 0; i < n; i++) {
    long long p = (use[i][(i + 1) % n] * use[i][(i + 2) % n]) /
                  use[(i + 1) % n][(i + 2) % n];
    p = sqrt(p);
    cout << p << " ";
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t;
  t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
