#include using namespace std; /* macro */ #define rep(i,a,b) for(int i=a;i b; i--) #define int long long #define exist(s,e) ((s).find(e)!=(s).end()) #define all(v) (v).begin(), (v).end() #define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++) #define sum(v) accumulate(all(v), (0LL)) #define sort(v) sort(all(v)) /* constant */ const int inf = 100100100100100100; const int mod = 1000000007; int dx[8]={1,0,-1,0,-1,1,-1,1}; int dy[8]={0,1,0,-1,-1,-1,1,1}; /* io_method */ int input(){int tmp;cin >> tmp;return tmp;} string raw_input(){string tmp;cin >> tmp;return tmp;} string readline(){string s;getline(cin, s);return s;} template void printx(T n){cout << n;} template void printx(pair p){cout << "(" << p.first << "," << p.second << ")";} template void printx(vector v){cout << "{";rep(i,0,v.size()){printx(v[i]);if(i != v.size()-1)printx(",");}cout << "}";} template void print(T n){printx(n);cout << endl;} template void print(set s){cout << "{";each(s, e){if(e != s.begin()) printx(",");printx(*e);}cout << "}" << endl;} template void print(map mp){cout << "{";each(mp, e){cout << "(" << e -> first << "," << e -> second << ")";}cout << "}" << endl;} /* general_method */ templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b arr; rep(i,0,n) arr.push_back(input()); int x, y; cin >> x >> y; sort(arr); int d = *max_element(all(arr)); int to = max(abs(x), abs(y)); if(to == 0){ print(0); return 0; } rep(i,0,n){ if(to == arr[i]){ print(1); return 0; } } int ans = 0; if(to > d * 2) ans = ceil(to - d * 2, d); to -= d * ans; if(to == d){ print(ans + 1); return 0; }else{ print(ans + 2); return 0; } }