#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>

using namespace std;

#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)

template<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<" "; cerr<<endl; }
inline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }

typedef long long ll;
const int INF = 100000000;
const double EPS = 1e-8;
const int MOD = 1000000007;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
ll gcd(ll x, ll y){
  if(x % y == 0) return y;
  else return gcd(y, x % y);
}
ll lcm(ll x, ll y){
  return x * y / gcd(x, y);
}
int main(){
  int N;
  while(cin >> N && N){
    ll d[10], v[10];
    REP(i, N) cin >> d[i] >> v[i];
    REP(i, N){
      ll g = gcd(d[i], v[i]);
      d[i] /= g;
      v[i] /= g;
    }
    ll D = d[0], V = v[0];
    REP(i, N){
      D = lcm(D, d[i]);
      V = gcd(V, v[i]);
    }
    REP(i, N){
      cout<< D / d[i] * v[i] / V << endl;
    }
  }
  return 0;
}