#include<bits/stdc++.h>
using i64=long long;
using u64=unsigned long long;
using namespace std;

template<u64 mod> struct modint{
  u64 val;
  modint(i64 val_=0):val((val_%i64(mod)+i64(mod))%i64(mod)){}
  modint operator-(){
    return (val==0)?0:mod-val;
  }
  modint operator+(modint rhs){
    return modint(*this)+=rhs;
  }
  modint operator-(modint rhs){
    return modint(*this)-=rhs;
  }
  modint operator*(modint rhs){
    return modint(*this)*=rhs;
  }
  modint operator/(modint rhs){
    return modint(*this)/=rhs;
  }
  modint pow(i64 rhs){
    modint res=1,now=(*this);
    while(rhs){
      res*=((rhs&1)?now:1),now*=now,rhs>>=1;
    }
    return res;
  }
  modint &operator+=(modint rhs){
    val+=rhs.val,val-=((val>=mod)?mod:0);
    return (*this);
  }
  modint &operator-=(modint rhs){
    val+=((val<rhs.val)?mod:0),val-=rhs.val;
    return (*this);
  }
  modint &operator*=(modint rhs){
    val=val*rhs.val%mod;
    return (*this);
  }
  modint &operator/=(modint rhs){
    return (*this)*=rhs.pow(mod-2);
  }
  bool operator==(modint rhs){
    return val==rhs.val;
  }
  bool operator!=(modint rhs){
    return val!=rhs.val;
  }
  friend std::ostream &operator<<(std::ostream& os,modint x){
    return os<<(x.val);
  }
  friend std::istream &operator>>(std::istream& is,modint& x){
    u64 t;
    is>>t,x=t;
    return is;
  }
};

struct primefact{
  int n;
  vector<i64> lpf;
  primefact(int n_):n(n_),lpf(n_+1,-1){
    for(i64 p=2;p<=n;++p){
      if(lpf[p]!=-1){
        continue;
      }
      lpf[p]=p;
      for(i64 q=p;q<=n;q+=p){
        if(lpf[q]==-1){
          lpf[q]=p;
        }
      }
    }
  }
  vector<pair<i64,i64>> operator()(int m){
    vector<i64> v;
    while(m!=1){
      v.emplace_back(lpf[m]);
      m/=lpf[m];
    }
    if(v.size()==0){
      return {};
    }
    vector<pair<i64,i64>> res;
    res.emplace_back(v[0],1);
    for(size_t i=1;i<v.size();++i){
      if(v[i-1]!=v[i]){
        res.emplace_back(v[i],1);
      }
      else{
        res.back().second++;
      }
    }
    return res;
  }
};

int main(){
  constexpr u64 mod=998244353;
  typedef modint<mod> mint;
  primefact pf(300'001);
  int N;
  cin>>N;
  vector<i64> A(N),B(N);
  vector<vector<pair<i64,i64>>> idx(300'001);
  vector<i64> m(300'001);
  for(int i=0;i<N;++i){
    cin>>A[i]>>B[i];
    auto tmp=pf(B[i]);
    for(auto [p,e]:tmp){
      idx[p].emplace_back(i,e);
      m[p]=max(m[p],e);
    }
  }
  mint ans=1;
  for(i64 p=2;p<=300'001;++p){
    if(m[p]==0){
      continue;
    }
    vector<i64> pw(21,1);
    for(int i=1;i<=20;++i){
      pw[i]=pw[i-1]*p;
    }
    i64 sm=0;
    for(auto [i,e]:idx[p]){
      sm+=A[i]*pw[m[p]-e];
      sm%=pw[m[p]];
    }
    i64 prd=pw[m[p]];
    for(int i=0;i<m[p];++i){
      if(sm%p==0){
        sm/=p;
        prd/=p;
      }
      else{
        break;
      }
    }
    ans*=prd;
  }
  cout<<ans<<endl;
}