#include <bits/stdc++.h> using namespace std; const int N = 1e4 + 5; int n , ans = 1; struct node { int x , y; }a[N]; bool cmp(node a , node b) { if(a.x != a.y) return a.x < b.x; return a.y > b.y; } int main() { cin >> n; for(int i = 1;i <= n + 1;i++) cin >> a[i].x >> a[i].y; sort(a + 2, a + n + 2 , cmp); for(int i = 1;i <= n;i++) ans *= a[i].x; // cout << ans << " "; cout << ans / a[n + 1].y; return 0; }