#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cerr << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cerr<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = (1 << 30) - 1;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; //use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////

int N;
pl P[MAX_N];
ll AB[MAX_N];
ll S[MAX_N];

void solve() {
	cin >> N;
	rep(i, 0, N) {
		ll a, b;
		cin >> a >> b;
		P[i] = pl(b, a - b);
	}
	sort(P, P + N, [](pl p1, pl p2){
			return p1.fst + max(p1.sec, 0ll) < p2.fst + max(p2.sec, 0ll);
			});
	ll nsum = 0;
	rep(i, 0, N) {
		AB[i] = P[i].fst + max(P[i].sec, 0ll);
		S[i + 1] = AB[i] + S[i];
		nsum += min(P[i].sec, 0ll);
	}
	// debug(vector<pl>(P, P + N));
	// debug(vector<ll>(AB, AB + N), nsum);
	ll n = 0, p = 0, q = 1;
	rep(i, 0, N) {
		ll tn = 0, tp = 0, tq = 0;
		ll bound = nsum;
		if(P[i].sec > 0) {
			bound += P[i].sec;
		}
		if(S[i] + bound >= 0) {
			tn = upper_bound(S, S + N + 1, -bound) - S - 1;
			tp = -(S[tn] + bound); 
		}
		else {
			tn = upper_bound(S, S + N + 1, -bound + AB[i]) - S - 1;
			tp = -(S[tn] + bound - AB[i]);
			tn--;
		}
		if(tp >= P[i].fst) {
			tp = 1; tq = 1;
		}
		else {
			tq = P[i].fst;
		}
		// debug(i, tn, tp, tq);
		bool update = false;
		if(tn > n) update = true;
		else if(tn == n) {
			if(tp * q > p * tq) update = true;
		}
		if(update) {
			n = tn; p = tp; q = tq;
		}
	}
	p += n * q;
	q *= N;
	ll g = __gcd(p, q);
	cout << p / g << " " << q / g << "\n";
}

uint32_t rd() {
	uint32_t res;
#ifdef __MINGW32__
	asm volatile("rdrand %0" :"=a"(res) ::"cc");
#else
	res = std::random_device()();
#endif
	return res;
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
    cerr << fixed;
	cerr.precision(6);
	rng.seed(rd());
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
	if(!freopen("in.txt", "rt", stdin)) return 1;
#endif	
	solve();
    cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
	return 0;
}



Measured memory_bytes: 9216