#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

bool  solve(){
    int n;
    cin >> n;
    if(!n) return false;
    vector<ll> d(n), v(n);
    for (int i = 0; i < n; ++i) {
        cin >> d[i] >> v[i];
        int g = __gcd(d[i], v[i]);
        d[i] /= g; v[i] /= g;
    }
    ll a = v[0], b = d[0];
    for (int i = 1; i < n; ++i) {
        a = __gcd(a, v[i]);
        b = b/__gcd(b, d[i])*d[i];
    }
    for (int i = 0; i < n; ++i) {
        cout << b*v[i]/a/d[i] << "\n";
    }
    return true;
}

int main() {
    while(solve());
    return 0;
}
