#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<list>
#include<bitset>
#include<stack>
#include<memory>
#include<numeric>
using namespace std;
using namespace std::chrono;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
#define REP(i, n) for(int64 i = 0;i < (n);i++)
/*cout<<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);*/
const int mod=998244353 ;
const llint inf=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-10;
template <class T,class U>bool chmin(T& a,U b){if(a>b){a=b;return true;}return false;}
template <class T,class U>bool chmax(T& a,U b){if(a<b){a=b;return true;}return false;}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(const vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(const vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}
//13:14~

int main(void){
	cout<<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);
	llint n,i;cin>>n;
	llint At=0,ans=0;
	vector<pair<llint,llint>>hei(n);//通常move,ずらしmove
	for(i=0;i<n;i++){
		llint A,B;cin>>A>>B;
		if(A<=B){At+=B-A;hei[i]=mp(B,B);}
		else{hei[i]=mp(A,B);}
	}
	SO(hei);
	while(At>=hei[ans].fir){At-=hei[ans].fir;ans++;}
	//2パターン
	
	llint bbb=0;
	for(i=0;i<=ans;i++){chmax(bbb,hei[i].sec);}
	llint P=max(bbb+At-hei[ans].fir,0LL),Q=bbb;
	//At/aaa
	for(i=ans;i<n;i++){
		llint nP=At-hei[i].fir+hei[i].sec;
		llint nQ=hei[i].sec;
		if(P*nQ<Q*nP){P=nP,Q=nQ;}//1- At/bbbが大きい
		
	}
	
	P+=ans*Q;
	Q*=n;
	llint G=gcd(P,Q);
	cout<<P/G<<" "<<Q/G<<endl;
	return 0;
}
/*
s---r---|---
  A   B   C
Aゾーン すぬけ早い
Bゾーン すぬけ有利
Cゾーン

B-A 
*/
