Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"strings"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

func main() {
	for scanner.Scan() {
		n, _ := strconv.Atoi(scanner.Text())
		if n == 0 {
			break
		}
		d, v := make([]int, 0), make([]int, 0)
		for i := 0; i < n; i++ {
			scanner.Scan()
			buf := strings.Split(scanner.Text(), " ")
			a, _ := strconv.Atoi(buf[0])
			b, _ := strconv.Atoi(buf[1])
			g := _gcd(a, b)
			a /= g
			b /= g
			d = append(d, a)
			v = append(v, b)
		}
		g := lcm(n, d)
		for i := 0; i < n; i++ {
			d[i] = (g/d[i])*v[i]
		}
		g = gcd(n, d)
		for i := 0; i < n; i++ {
			fmt.Println(d[i]/g)
		}
	}
}

func _gcd(a, b int) int {
	for b != 0 {
		r := a % b
		a, b = b, r
	}
	return a
}

func gcd(n int, a []int) int {
	if n == 1 {
		return a[0]
	}
	g := _gcd(a[0], a[1])
	for i := 2; i < n; i++ {
		if g == 1 {
			break
		}
		g = _gcd(g, a[i])
	}
	return g
}

func lcm(n int, a []int) int {
	if n == 1 {
		return a[0]
	}
	g := _gcd(a[0], a[1])
	c := a[0] / g * a[1]
	for i := 2; i < n; i++ {
		g = _gcd(c, a[i])
		c = c / g * a[i]
	}
	return c
}

C++: #include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;

int n;
ll d[10],v[10];

ll lcm(ll a,ll b){
  return a/ __gcd(a,b) * b;
}

ll getGcd(){
  ll res=d[0];
  for(int i=1;i<n;i++){
    res = __gcd( res , d[i] );
  }
  return res;
}

int main(){
  while(cin>>n&&n){

    for(int i=0;i<n;i++){
      cin>>d[i]>>v[i];
    }
    
    for(int i=1;i<n;i++){
      for(int j=0;j<n;j++)d[j]=d[j]*v[(j+i)%n];
      ll x = getGcd();
      for(int j=0;j<n;j++)d[j]/=x;
    }
    ll y=d[0];
    for(int i=1;i<n;i++){
      y= lcm( y , d[i] );
    }

    for(int i=0;i<n;i++){
      cout<<y/d[i]<<endl;
    }
  }
  return 0;
}

C++: #include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
//#include <utility>
#include <set>
#include <iostream>
//#include <memory>
#include <string>
#include <vector>
#include <algorithm>
//#include <functional>
#include <sstream>
//#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
//#include <cctype>
#include <cstring>
//#include <ctime>
#include <iterator>
#include <bitset>
//#include <numeric>
//#include <list>
//#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>

#define cauto const auto&
#else

#endif

using namespace std;


namespace{
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}


#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()


#define MOD 1000000007LL
#define EPS 1e-8
static const int INF=1<<24;

void mainmain(){
	int n;
	while(cin>>n,n){
		vector<pll> v(n);
		rep(i,n) cin>>v[i].F>>v[i].S;
		ll g=v[0].S;
		rep(i,n-1){
			g=g*v[i+1].S/__gcd(g,v[i+1].S);
		}
		// cout<<"g "<<g<<endl;
		rep(i,n){
			ll t=g/v[i].S;
			v[i].F*=t;
		}
		ll f=v[0].F;
		rep(i,n-1){
			f=f/__gcd(f,v[i+1].F)*v[i+1].F;
		}
		// cout<<"f "<<f<<endl;
		rep(i,n){
			cout<<f/v[i].F<<endl;
		}
	}
}



}
main() try{
    mainmain();
}
catch(...){
}

C++: #include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

typedef unsigned long long ll;

ll gcd(ll a,ll b){
	if(b==0)
		return a;
	else
		return gcd(b,a%b);
}

ll lcm(ll a,ll b){
	return a*b/gcd(a,b);
}


void div(ll &d,ll &v){
	for(int i = 2; i < d; i++){
		if(d%i==0&&v%i==0){
			d/=i;
			v/=i;
			i--;
		}
	}
}

int main(){

	ll n;
	while(cin>>n&&n!=0){
		ll d,v;
		vector<ll> ds;
		vector<ll> vs;
		for(ll i = 0; i < n; i++){
			cin>>d>>v;

		//	div(d,v);
			ds.push_back(d);
			vs.push_back(v);
		}
		ll z=1;
		ll nums[11];
		ll allv=1;
		//for(ll i = 0; i < n; i++){
		//	allv*=vs[i];
		//}

		//for(ll i = 0; i < n; i++){
		//	nums[i]=ds[i]*allv/vs[i];
		//	z=lcm(z,nums[i]);
		//}
		//for(ll i = 0; i < n; i++){
		//	cout<<(z/nums[i])<<endl;
		//}
		for(int i = 1; i < n; i++){
			ll n1=ds[i-1]*vs[i];
			ll n2=ds[i]*vs[i-1];
			ll ret=lcm(n1,n2);
			ll r1=ret/n1;
			ll r2=ret/n2;
			if(ds[i-1]==ds[i]&&vs[i-1]==vs[i]){
				z=lcm(z,1);
			}
			else
				z=lcm(z,r1*ds[i-1]/vs[i-1]);
		}
		vector<ll> vll;
		ll m;
		if(z!=1){
			for(ll i = 0; i < n; i++){
				vll.push_back(z*vs[i]/ds[i]);
				if(i==0){
					m=z*vs[i]/ds[i];
				}
				else{
					m=gcd(m,z*vs[i]/ds[i]);
				}
			}
			for(int i = 0; i < n; i++){
				cout<<vll[i]/m<<endl;
			}
		}
		else{
			for(int i = 0; i < n; i++){
				cout<<1<<endl;
			}
		}
	}

	return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

typedef unsigned long long ll;

ll gcd(ll a,ll b){
	if(b==0)
		return a;
	else
		return gcd(b,a%b);
}

ll lcm(ll a,ll b){
	return a*b/gcd(a,b);
}


void div(ll &d,ll &v){
	for(int i = 2; i < d; i++){
		if(d%i==0&&v%i==0){
			d/=i;
			v/=i;
			i--;
		}
	}
}

int main(){

	ll n;
	while(cin>>n&&n!=0){
		ll d,v;
		vector<ll> ds;
		vector<ll> vs;
		for(ll i = 0; i < n; i++){
			cin>>d>>v;

			div(d,v);
			ds.push_back(d);
			vs.push_back(v);
		}
		ll z=1;
		ll nums[11];
		ll allv=1;
		//for(ll i = 0; i < n; i++){
		//	allv*=vs[i];
		//}

		//for(ll i = 0; i < n; i++){
		//	nums[i]=ds[i]*allv/vs[i];
		//	z=lcm(z,nums[i]);
		//}
		//for(ll i = 0; i < n; i++){
		//	cout<<(z/nums[i])<<endl;
		//}
		for(int i = 1; i < n; i++){
			ll n1=ds[i-1]*vs[i];
			ll n2=ds[i]*vs[i-1];
			ll ret=lcm(n1,n2);
			ll r1=ret/n1;
			ll r2=ret/n2;
			if(ds[i-1]==ds[i]&&vs[i-1]==vs[i]){
				z=lcm(z,1);
			}
			else
				z=lcm(z,r1*ds[i-1]/vs[i-1]);
		}
		vector<ll> vll;
		ll m;
		if(z!=1){
			for(ll i = 0; i < n; i++){
				vll.push_back(z*vs[i]/ds[i]);
				if(i==0){
					m=z*vs[i]/ds[i];
				}
				else{
					m=gcd(m,z*vs[i]/ds[i]);
				}
			}
			for(int i = 0; i < n; i++){
				cout<<vll[i]/m<<endl;
			}
		}
		else{
			for(int i = 0; i < n; i++){
				cout<<1<<endl;
			}
		}
	}

	return 0;
}

C++: #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

long long gozyo(long long a,long long b){
  if(a<b){
    long long temp=a;
    a=b;
    b=temp;
  }
  while(a%b!=0){
    long long  temp=a%b;
    a=b;
    b=temp;
  }
  return b;
}

main(){
  int n;
  long long d[11];
  long long v[11];
  long long a[11];
  long long k1,k2,k3;
  long long t1,t2,t3;
  while( (cin >> n),n ){
    for(int i=0;i<n;i++){
      cin >> d[i] >> v[i];
    }



    k1=v[0];
    t1=v[0];
    for(int i=1;i<n;i++){
      k1 = gozyo(t1,v[i]);
      t1 = t1*v[i]/k1;
    }

    a[0]=t1/v[0]*d[0];
    k3=a[0];
    t3=a[0];
    for(int i=1;i<n;i++){
      a[i]=t1/v[i]*d[i];
      k3 = gozyo(t3,a[i]);
      t3 = t3/k3*a[i];
    }


    for(int i=0;i<n;i++){
      cout << t3/a[i] << endl;
    }
    

  }
}

C++: #include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

#define ll long long

ll gcd(ll a, ll b){
	return b==0?a:gcd(b,a%b);
}

ll lcm(ll a, ll b){
	return a*b/gcd(a,b);
}

int main(){
	int n;
	while(cin >> n && n){
		vector<pair<int,int> > v(n);
		vector<ll> cand;
		ll l=1;
		ll g;
		for(int i=0;i<n;i++){
			cin >> v[i].first >> v[i].second;
			l = lcm(l, v[i].first);
		}
		for(int i=0;i<n;i++){
			cand.push_back(l / v[i].first * v[i].second);
		}
		g = cand[0];
		for(int i=1;i<n;i++){
			g = gcd(g, cand[i]);
		}
		for(int i=0;i<n;i++){
			cout << cand[i] / g << endl;
		}
	}
}