#include <bits/stdc++.h>

using i64 = long long;
template<class T>
T qmi(T a, i64 b) {
  T res = 1;
  for (; b; b /= 2, a *= a) {
    if (b % 2) {
      res *= a;
    }
  }
  return res;
}

i64 mul(i64 a, i64 b, i64 p) {
  i64 res = a * b - i64(1.L * a * b / p) * p;
  res %= p;
  if (res < 0) {
    res += p;
  }
  return res;
}

template<int P>
struct modint {
  int x;
  constexpr modint() : x{} {}
  constexpr modint(i64 x) : x{norm(x % getmod())} {}

  static int mod;
  constexpr static int getmod() {
    if (P > 0) {
      return P;
    } else {
      return mod;
    }
  }
  constexpr static void setmod(int m) {
    mod = m;
  }
  constexpr int norm(int x) const {
    if (x < 0) {
      x += getmod();
    }
    if (x >= getmod()) {
      x -= getmod();
    }
    return x;
  }
  constexpr int val() const {
    return x;
  }
  explicit constexpr operator int() const {
    return x;
  }
  constexpr modint operator-() const {
    modint res;
    res.x = norm(getmod() - x);
    return res;
  }
  constexpr modint inv() const {
    assert(x != 0);
    return qmi(*this, getmod() - 2);
  }
  constexpr modint &operator*= (modint v) & {
    x = 1LL * x * v.x % getmod();
    return *this;
  }
  constexpr modint &operator+= (modint v) & {
    x = norm(x + v.x);
    return *this;
  }
  constexpr modint &operator-= (modint v) & {
    x = norm(x - v.x);
    return *this;
  }
  constexpr modint &operator/= (modint v) & {
    return *this *= v.inv();
  }
  friend constexpr modint operator- (modint a, modint b) {
    modint res = a;
    res -= b;
    return res;
  }
  friend constexpr modint operator+ (modint a, modint b) {
    modint res = a;
    res += b;
    return res;
  }
  friend constexpr modint operator* (modint a, modint b) {
    modint res = a;
    res *= b;
    return res;
  }
  friend constexpr modint operator/ (modint a, modint b) {
    modint res = a;
    res /= b;
    return res;
  }
  friend constexpr std::istream &operator>> (std::istream& is, modint& a) {
    i64 v;
    is >> v;
    a = modint(v);
    return is;
  }
  friend constexpr std::ostream &operator<< (std::ostream& os, const modint& a) {
    return os << a.val();
  }
  friend constexpr bool operator== (modint a, modint b) {
    return a.val() == b.val();
  }
  friend constexpr bool operator!= (modint a, modint b) {
    return a.val() != b.val();
  }
};

constexpr int P = 998244353;
using mint = modint<P>;

std::vector<int> minp, primes;
 
void sieve(int n) {
  minp.assign(n + 1, 0);
  primes.clear();

  for (int i = 2; i <= n; i++) {
    if (minp[i] == 0) {
      minp[i] = i;
      primes.push_back(i);
    }

    for (auto p : primes) {
      if (i * p > n) {
        break;
      }
      minp[i * p] = p;
      if (p == minp[i]) {
        break;
      }
    }
  }
}

int exgcd(int a, int b, int &x, int &y) {
  if (b == 0) {
    x = 1, y = 0;
    return a;
  }
  int d = exgcd(b, a % b, y, x);
  y -= a / b * x;
  return d;
}

int inv(int a, int p) {
  int x, y;
  exgcd(a, p, x, y);
  return (x % p + p) % p;
}

int main() {
  // freopen("number.in", "r", stdin);
  // freopen("number.out", "w", stdout);
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int n;
  std::cin >> n;

  std::vector<int> a(n), b(n);
  for (int i = 0; i < n; i++) {
    std::cin >> a[i] >> b[i];
    int d = std::__gcd(a[i], b[i]);
    a[i] /= d;
    b[i] /= d;
  }

  const int V = 1E6;
  sieve(V);

  std::vector<std::vector<std::array<int, 3>>> vec(V + 1);
  for (int i = 0; i < n; i++) {
    int x = b[i];
    while (x > 1) {
      int cur = 0;
      int p = minp[x], mul = 1;
      while (x % p == 0) {
        x /= p;
        mul *= p;
        cur++;
      }
      vec[p].push_back({cur, b[i] / mul, i});
    }
  }

  mint ans = 1;
  std::vector<int> cnt(V + 1);
  for (auto p : primes) {
    std::sort(vec[p].begin(), vec[p].end(), std::greater());
    int m = vec[p].size();
    for (int i = 0; i < m; i++) {
      int j = i;
      while (j < m && vec[p][i][0] == vec[p][j][0]) {
        j++;
      }
      int K = vec[p][i][0];
      ans *= qmi(mint(p), 1LL * K * i * (j - i));
      int np = 1;
      i64 tot = 0;
      for (int nk = 1; nk <= K; nk++) {
        np *= p;
        for (int l = i; l < j; l++) {
          auto [_, na, id] = vec[p][l];
          na = inv(na, np);
          na = 1LL * na * a[id] % np;
          tot += cnt[na];
          cnt[na]++;
        }
        for (int l = i; l < j; l++) {
          auto [_, na, id] = vec[p][l];
          na = inv(na, np);
          na = 1LL * na * a[id] % np;
          cnt[na]--;
        }
      }

      i64 w = 1LL * (j - i) * (j - i - 1) / 2;
      ans *= qmi(mint(p), K * w + tot);

      i = j - 1;
    }
  }

  ans = ans.inv();
  for (int i = 0; i < n; i++) {
    ans *= qmi(mint(b[i]), n - 1);
  }
  std::cout << ans << "\n";

  return 0;
}