#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long MOD = 1e9 + 7;
inline long long add(long long &x, long long y) {
  x += y;
  if (x >= mod) x -= mod;
  return x;
}
inline long long sub(long long x, long long y) {
  x -= y;
  if (x < 0) x += mod;
  return x;
}
inline long long mul(long long x, long long y) { return (x * 1ll * y) % mod; }
mt19937 rng32(chrono::steady_clock::now().time_since_epoch().count());
inline void io() {}
const long long N = 3005;
long long m[N][N];
signed main() {
  io();
  long long n;
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    for (long long j = 1; j <= n; j++) {
      cin >> m[i][j];
    }
  }
  long long a1 = (long long)sqrt(m[1][2] * m[1][3] / m[2][3]);
  cout << a1 << " ";
  for (long long i = 2; i <= n; i++) cout << (m[1][i] / a1) << " ";
}
