#include <bits/stdc++.h>
using namespace std;
const int MAX = (int)1e3 + 5;
int n;
long long p[MAX][MAX];
long long f(long long a, long long b, long long c) {
  long long ans = a * c / b;
  long long sq = (long long)sqrt(ans + 0.5);
  return sq;
}
long long f(int a) {
  int b = 0;
  if (a == b) b = 1;
  int c = 1;
  while (c == a || c == b) c++;
  int d = a;
  return f(p[c][a], p[c][b], p[d][b]);
}
int main() {
  scanf("%d", &n);
  for (int i = (0), _for = (n); i < _for; ++i)
    for (int j = (0), _for = (n); j < _for; ++j) scanf("%lld", &p[i][j]);
  for (int i = (0), _for = (n); i < _for; ++i) {
    printf("%lld\n", f(i));
  }
  return 0;
}
