#include <bits/stdc++.h>
using namespace std;
long long n, a[2000][2000];
long long ans[2000];
bool check() {
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (i != j) {
        if (ans[i] * ans[j] != a[i][j]) return false;
      }
    }
  }
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) cin >> a[i][j];
  for (long long i = 1; i * i <= a[0][1]; i++) {
    if (a[0][1] % i == 0) {
      long long curr = i;
      ans[0] = curr;
      bool can = true;
      for (int j = 1; j < n; j++) {
        if (a[0][j] % curr != 0) {
          can = false;
          break;
        } else
          ans[j] = a[0][j] / curr;
      }
      if (can) {
        if (check()) {
          for (int j = 0; j < n; j++) cout << ans[j] << ' ';
          return 0;
        }
      }
      curr = a[0][1] / i;
      can = true;
      ans[0] = curr;
      for (int j = 1; j < n; j++) {
        if (a[0][j] % curr != 0) {
          can = false;
          break;
        } else
          ans[j] = a[0][j] / curr;
      }
      if (can) {
        if (check()) {
          for (int j = 0; j < n; j++) cout << ans[j] << ' ';
          return 0;
        }
      }
    }
  }
  assert(1 == 5);
}
