#include <bits/stdc++.h>
using namespace std;
inline void umax(long long &a, long long b) { a = max(a, b); }
inline void umin(long long &a, long long b) { a = min(a, b); }
inline pair<long long, long long> rv(pair<long long, long long> a) {
  return make_pair(a.second, a.first);
}
const long long N = 1e3 + 10;
const long long INF = 1e16 + 10;
const pair<long long, long long> NINF = make_pair(INF, INF);
const long double EPS = 1e-6;
const long long II = 1e9;
const long long MOD = 1e9 + 9;
long long ar[N][N];
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  for (long long i = 0; i < (n); i++)
    for (long long j = 0; j < (n); j++) cin >> ar[i][j];
  long long first = sqrt(ar[0][1] * ar[2][0] / ar[1][2]);
  vector<long long> ans(n);
  ans[0] = first;
  for (long long i = 0; i < (n - 1); i++) ans[i + 1] = ar[i + 1][0] / first;
  for (long long i = 0; i < (n); i++) cout << ans[i] << ' ';
}
