#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;

    vector<int> d(n);
    for (int i = 0; i < n; i++) {
        cin >> d[i];
    }

    int x, y;
    cin >> x >> y;
    int t = x + y; y = x - y; x = t;
    int z = max(abs(x), abs(y));

    int ans = -1;

    sort(d.begin(), d.end());
    if (z <= d[n - 1] * 2 && z % 2 == 0) ans = 2;

    int d_max[2] = {};
    for (int i = 0; i < n; i++) {
        int p = d[i] % 2;
        d_max[p] = d[i];
        int d1 = d_max[p ^ 1];
        if (d1 != 0 && d[i] - d1 <= z && z <= d[i] + d1 && z % 2 == 1) ans = 2;
    }

    for (int i = 0; i < n; i++) {
        if (z == d[i]) ans = 1;
    }

    if (z == 0) ans = 0;

    cout << ans << endl;

    return 0;
}