#include<bits/stdc++.h>

using namespace std;
int tot = 0;
vector<array<int, 2> > v;

int fit(vector<array<int, 2> > v, int s1, int s2, int bit) {
    for (int i = 0; i < (1 << (int)(v.size())); i ++) {
        if ((bit&i) != i) {
            continue;
        }
        int s = s2;
        for (int j = 0; j < v.size(); j ++) {
            if ((i & (1 << j)) && v[j][0] == s1) {
                s -= v[j][1];
            }
        }
        if (!s) return i;
        s = s1;
        for (int j = 0; j < v.size(); j ++) {
            if ((i & (1 << j)) && v[j][1] == s2) {
                s -= v[j][0];
            }
        }
        if (!s) return i;
    }
    return -1;
}

int ddi(vector<array<int, 2> > v, int s1, int s2, int bit) {
    if (s1*s2 == 0) {
        return 1;
    }
    for (int i = 1; i <= s1; i ++) {
        int bb = fit(v, i, s2, bit);
        if (bb != -1) {
            if (ddi(v, s1 - i, s2, bb^bit)) {
                return 1;
            }
        }
    }
    for (int i = 1; i <= s2; i ++) {
        int bb = fit(v, s1, i, bit);
        if (bb != -1) {
            if (ddi(v, s1, s2 - i, bb^bit)) {
                return 1;
            }
        }
    }
    return 0;
}

main() {
    for (int i = 0; i < 4; i ++) {
        int a, s;
        cin >> a >> s;
        v.push_back({a, s});
        tot += a * s;
    }

    int a = sqrt(tot);
    if (a*a != tot) {
        cout << 0;
        return 0;
    }

    cout << ddi(v, a, a, (1 << v.size()) - 1);
}