#include using namespace std; typedef signed long long ll; #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define FORR2(x,y,arr) for(auto& [x,y]:arr) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) template bool chmax(T &a, const T &b) { if(a bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;} //------------------------------------------------------- int N; int M[202020]; void solve() { int i,j,k,l,r,x,y; string s; cin>>N; int ret=0; FOR(i,N) { cin>>x>>y; ret=max(ret,min(y,M[x])); M[x]=max(M[x],y); } for(i=1;i<=200000;i++) { vector> cand={}; for(j=i;j<=200000;j+=i) if(M[j]) cand.push_back({1LL*j*M[j],j}); sort(ALL(cand)); int ma=1<<30; FORR2(a,b,cand) { if(ma!=1<<30) ret=max((ll)ret,(ll)i*M[b]/ma); ma=min(ma,b); } } cout<