#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int findGCD(int arr[], int n) {
  int result = arr[0];
  for (int i = 1; i < n; i++) result = gcd(arr[i], result);
  return result;
}
int main(int argc, const char* argv[]) {
  int n;
  cin >> n;
  int arr[n][n];
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      cin >> arr[i][j];
    }
  }
  long long a = arr[0][1];
  long long b = arr[0][2];
  long long c = arr[1][2];
  long long u = sqrt(a * b / c);
  cout << u << " ";
  for (int i = 1; i < n; i++) {
    cout << arr[0][i] / u << " ";
  }
  return 0;
}
