#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
using namespace std;
bool dbg = 0;
clock_t start_time = clock();
void bad(string mes = "Impossible") {
  cout << mes;
  exit(0);
}
void bad(int mes) {
  cout << mes;
  exit(0);
}
template <typename T>
string bin(T x, int st = 2) {
  string ans = "";
  while (x > 0) {
    ans += char('0' + x % st);
    x /= st;
  }
  reverse(ans.begin(), ans.end());
  return ans.empty() ? "0" : ans;
}
mt19937_64 mt_rand(chrono::system_clock::now().time_since_epoch().count());
template <typename T1, typename T2>
inline bool upmax(T1& a, T2 b) {
  return (a < b ? (a = b, true) : false);
}
template <typename T1, typename T2>
inline bool upmin(T1& a, T2 b) {
  return (b < a ? (a = b, true) : false);
}
template <typename T>
T input() {
  T ans = 0, m = 1;
  char c = ' ';
  while (!((c >= '0' && c <= '9') || c == '-')) {
    c = getchar();
  }
  if (c == '-') m = -1, c = getchar();
  while (c >= '0' && c <= '9') {
    ans = ans * 10 + (c - '0'), c = getchar();
  }
  return ans * m;
}
template <typename T>
T gcd(T a, T b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
template <typename T>
void read(T& a) {
  a = input<T>();
}
template <typename T>
void read(T& a, T& b) {
  read(a), read(b);
}
template <typename T>
void read(T& a, T& b, T& c) {
  read(a, b), read(c);
}
template <typename T>
void read(T& a, T& b, T& c, T& d) {
  read(a, b), read(c, d);
}
const int inf = 1e9 + 20;
const short short_inf = 3e4 + 20;
const long double eps = 1e-12;
const int maxn = (int)1e7 + 3, base = 998244353;
const long long llinf = 2e18 + 5;
int binpow(int a, int second) {
  int res = 1;
  while (second) {
    if (second % 2) {
      res = 1ll * res * a % base;
    }
    a = 1ll * a * a % base;
    second /= 2;
  }
  return res;
}
struct Frac {
  long long p, q;
  Frac() { p = 0, q = 1; }
  Frac(long long p, long long q) : p(p), q(q) {}
  void norm() {
    if (q < 0) p = -p, q = -q;
    if (p == 0) q = 1;
    long long g = gcd(abs(p), q);
    p /= g;
    q /= g;
  }
  Frac& operator+=(const Frac& b) {
    p = p * b.q + q * b.p;
    q = q * b.q;
    norm();
    return *this;
  }
  friend Frac operator+(Frac a, const Frac& b) {
    a += b;
    return a;
  }
  Frac& operator*=(const Frac& b) {
    p = p * b.p;
    q = q * b.q;
    norm();
    return *this;
  }
  friend Frac operator*(Frac a, const Frac& b) {
    a *= b;
    return a;
  }
  Frac& operator-=(const Frac& b) {
    p = p * b.q - q * b.p;
    q = q * b.q;
    norm();
    return *this;
  }
  friend Frac operator-(Frac a, const Frac& b) {
    a -= b;
    return a;
  }
  Frac& operator/=(const Frac& b) {
    p = p * b.q;
    q = q * b.p;
    norm();
    return *this;
  }
  friend Frac operator/(Frac a, const Frac& b) {
    a /= b;
    return a;
  }
  bool operator<(const Frac& T) const { return p * T.q < T.p * q; }
  bool operator<=(const Frac& T) const { return p * T.q <= T.p * q; }
};
std::ostream& operator<<(std::ostream& out, const Frac& first) {
  return out << first.p << ' ' << first.q;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<pair<int, int> > ra, rb;
  for (int i = 0; i < n; i++) {
    int x, y;
    cin >> x >> y;
    if (x < y) {
      ra.push_back(make_pair(y, x));
    } else {
      rb.push_back(make_pair(x, y));
    }
  }
  sort((ra).begin(), (ra).end());
  sort((rb).begin(), (rb).end());
  reverse((ra).begin(), (ra).end());
  if (!ra.size()) {
    cout << 0 << ' ' << 1 << endl;
    return 0;
  }
  int ptr = 0;
  long long tkn = 0;
  {
    for (int i = 0; i < ra.size(); i++) {
      int a = ra[i].second;
      tkn += a;
      while (tkn >= ra[ptr].first) {
        tkn -= ra[ptr].first;
        ptr++;
      }
    }
  }
  Frac ans(0, 1);
  for (int i = 0; i <= rb.size(); i++) {
    Frac cur((long long)i, 1);
    cur += Frac((long long)ra.size() - ptr - 1, 1);
    cur += Frac(ra[ptr].first - tkn, (long long)ra[ptr].first * 1);
    upmax(ans, cur);
    if (i < rb.size()) {
      int a = rb[i].first;
      tkn += a;
      while (ptr < ra.size() && tkn >= ra[ptr].first) {
        tkn -= ra[ptr].first;
        ptr++;
      }
      if (ptr == ra.size()) {
        break;
      }
    }
  }
  ans.q *= n;
  ans.norm();
  cout << ans;
  return 0;
}
