#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int m[1005][1005], a[1005];
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  ;
  long long int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cin >> m[i][j];
    }
  }
  a[0] = m[0][0];
  for (int j = 0; j < n; j++) {
    a[0] = gcd(a[0], m[0][j]);
  }
  vector<long long int> cms;
  long long int tmp = a[0];
  for (long long int i = 1; i <= sqrt(tmp); i++) {
    if (tmp % i == 0) {
      cms.push_back(i);
      if (tmp / i != i) cms.push_back(tmp / i);
    }
  }
  sort(cms.begin(), cms.end());
  reverse(cms.begin(), cms.end());
  for (auto num : cms) {
    bool is = true;
    a[0] = num;
    for (int i = 1; i < n; i++) {
      a[i] = m[0][i] / a[0];
    }
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        if (i != j) {
          if (a[i] * a[j] != m[i][j]) {
            is = false;
            break;
          }
        }
      }
      if (!is) break;
    }
    if (is) {
      for (int i = 0; i < n; i++) cout << a[i] << " ";
      break;
    }
  }
  return 0;
}
