//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <vector>

namespace n91 {

using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

struct rep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
struct revrep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) noexcept {
  return a < b ? b - a : a - b;
}
template <class T> void chmin(T &a, const T &b) noexcept {
  if (b < a)
    a = b;
}
template <class T> void chmax(T &a, const T &b) noexcept {
  if (a < b)
    a = b;
}
template <class T> T scan() {
  T ret;
  std::cin >> ret;
  return ret;
}

} // namespace n91
#include <utility>

namespace n91 {

template <class T> constexpr T gcd(T m, T n) noexcept {
  while (n != static_cast<T>(0)) {
    m %= n;
    std::swap(m, n);
  }
  return m;
}

template <class T> constexpr T lcm(const T &m, const T &n) noexcept {
  return m / gcd(m, n) * n;
}

} // namespace n91

#include <algorithm>
#include <iostream>
#include <numeric>
#include <utility>


namespace n91 {

struct Q {
  u64 p, q;
  bool operator<(const Q &x) const { return p * x.q < x.p * q; }
};

void main_() {
  /*
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  //*/
  const usize n = scan<usize>();
  struct bar_t {
    u64 a, b;
  };
  std::vector<bar_t> bar(n);
  for (auto &e : bar) {
    std::cin >> e.a >> e.b;
  }
  u64 base = 0;
  std::vector<u64> ms;
  for (const auto &e : bar) {
    if (e.b > e.a) {
      base += e.b - e.a;
      ms.push_back(e.b);
    } else {
      ms.push_back(e.a);
    }
  }
  std::vector<usize> idx(n), rev(n);
  std::iota(idx.begin(), idx.end(), static_cast<usize>(0));
  std::sort(idx.begin(), idx.end(),
            [&](usize l, usize r) { return ms[l] < ms[r]; });
  for (const auto i : rep(0, n)) {
    rev[idx[i]] = i;
  }
  const u64 base_cp = base;
  usize mi;
  for (const usize i : rep(0, n)) {
    if (base >= ms[idx[i]]) {
      base -= ms[idx[i]];
    } else {
      mi = i;
      break;
    }
  }
  u64 ms_b = 0;
  for (const usize i : rep(0, mi)) {
    ms_b += ms[idx[i]];
  }
  Q ans = {0, 1};
  for (const auto i : rep(0, n)) {
    base = base_cp;
    if (bar[i].b > bar[i].a) {
      base -= bar[i].b - bar[i].a;
    }
    u64 msb_c = ms_b;
    if (rev[i] < mi) {
      msb_c -= ms[i];
      msb_c += ms[idx[mi]];
    }
    msb_c += bar[i].a;
    base += bar[i].b;
    if (base < msb_c) {
      continue;
    }
    chmax(ans, Q({base - msb_c, bar[i].b}));
  }
  u64 p = ans.p + ans.q * mi;
  u64 q = n * ans.q;
  const u64 g = gcd(p, q);
  p /= g;
  q /= g;
  std::cout << p << ' ' << q << std::endl;
}

} // namespace n91

int main() {
  n91::main_();
  return 0;
}


Measured memory_bytes: 4340