#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 10;
int gi() {
  int x = 0, o = 1;
  char ch = getchar();
  while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
  if (ch == '-') o = -1, ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x * o;
}
int n, a[N][N];
long long cal(long long x) {
  long long y = sqrt(x) + 10;
  while (y * y > x) --y;
  return y;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) a[i][j] = gi();
  for (int i = 1; i <= n; i++) {
    int x, y;
    if (i == 1)
      x = 2, y = 3;
    else if (i == 2)
      x = 1, y = 3;
    else
      x = 1, y = 2;
    cout << cal(1ll * a[i][x] * a[i][y] / a[x][y]) << ' ';
  }
  return 0;
}
