import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void main() { try { for (; ; ) { const N = readInt; auto A = new int[N]; auto P = new long[N]; foreach (i; 0 .. N) { A[i] = readInt; P[i] = readLong; } const maxA = A.maxElement; auto pss = new long[][maxA + 1]; foreach (i; 0 .. N) { pss[A[i]] ~= P[i]; } foreach (a; 1 .. maxA + 1) { pss[a].sort!"a > b"; } long ans; foreach (d; 1 .. maxA + 1) { // maxi. min{p / (b/d), q / (a/d)} alias Entry = Tuple!(long, "a", long, "p"); Entry[] es; for (int a = d; a <= maxA; a += d) { foreach (index, p; pss[a]) { if (index >= 2) break; es ~= Entry(a, p); } } es.sort!((e, f) => (e.a * e.p < f.a * f.p)); foreach (j; 1 .. cast(int)(es.length)) { const p = es[j - 1].p; const b = es[j].a; chmax(ans, d * p / b); } } writeln(ans); } } catch (EOFException e) { } }