#include <bits/stdc++.h>
using namespace std;
long long int max(long long int a, long long int b) {
  if (a > b)
    return a;
  else
    return b;
}
long long int min(long long int a, long long int b) {
  if (a < b)
    return a;
  else
    return b;
}
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long int lcm(long long int a, long long int b) {
  return (max(a, b) / gcd(a, b)) * min(a, b);
}
int main() {
  long long int n;
  cin >> n;
  long long int a[n][n];
  for (long long int i = 0; i < n; i++) {
    for (long long int j = 0; j < n; j++) {
      cin >> a[i][j];
    }
  }
  for (long long int i = 0; i < n - 2; i++) {
    cout << (long long int)sqrt((a[i][i + 1] * a[i][i + 2]) / a[i + 1][i + 2])
         << " ";
  }
  cout << (long long int)(sqrt((a[n - 2][n - 1] * (a[n - 2][n - 3])) /
                               a[n - 3][n - 1]))
       << " "
       << (long long int)(sqrt((a[n - 2][n - 1] * (a[n - 1][n - 3])) /
                               a[n - 3][n - 2]));
}
