#define _USE_MATH_DEFINES
#include <iostream>
#include <complex>
#include <algorithm>
#include <vector>
#include <stack>
#include <string>
#include <queue>
#include <cmath>
#include <math.h>
#include <numeric>
#include <list>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <climits>
#include <set>
#include <memory.h>
#include <memory>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cassert>
#include <map>
#include <cassert>
#include <time.h>
#include <ctime>

using namespace std;

typedef complex<double> xy_t;
typedef pair<xy_t, xy_t> line;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int , P> PP;
typedef pair<int, string> Ps;
typedef vector<int> vec;
typedef vector<vec> mat;
const int INF = 1 << 27;
const double EPS = 1e-10;
const double PI = 3.1415926535897932384626433832795;
const int CLK = CLOCKS_PER_SEC;

#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, m, n) for(int i = m; i < n; i++)
#define repD(i, n) for(int i = n; i >= 0; i--)

ll v[100];
ll d[100];
ll ratio[100];

ll gcd(ll u, ll v){
	while(u > 0){
		if(v > u) swap(u, v);
		u %= v;
	}
	return v;
}

ll lcm(ll u, ll v){
	return u / gcd(u, v) * v;
}

int main(){
	int n;
	while(cin >> n && n){
		ll tv = 1LL;
		rep(i, n){
			cin >> d[i] >> v[i];
			tv *= v[i];
		}
		rep(i, n) ratio[i] = d[i] * tv / v[i];
		ll c = ratio[0];
		ll m = 1LL;
		rep(i, n){
			c = gcd(c, ratio[i]);
		}
		rep(i, n) ratio[i] /= c;
		rep(i, n) m = lcm(m, ratio[i]);
		rep(i, n) cout << m / ratio[i] << endl;
	}	
	return 0;
}