#include #include using namespace std; const int N = 20, INF = 0x3f3f3f3f; int n, d[N], tx, ty; int main() { // freopen("game.in", "r", stdin); // freopen("game.out", "w", stdout); scanf("%d", &n); for (int i = 1; i <= n; ++i) scanf("%d", &d[i]); scanf("%d%d", &tx, &ty); int dist = max(abs(tx), abs(ty)); if (dist == 0) { puts("0"); return 0; } int ans = INF; for (int i = 0; i < n; ++i) { int cnt = 0; if (dist == d[i]) { cnt = 1; } else if (dist < d[i]) { cnt = 2; } else { cnt = (dist + d[i] - 1) / d[i]; } if (cnt < ans) { ans = cnt; } } printf("%d\n", ans); return 0; }