#include <bits/stdc++.h>
using namespace std;

bool check(vector<pair<int, int>> &v) {
    if(v[0].second == v[1].second && v[2].second == v[3].second && v[0].first + v[1].first == v[2].first + v[3].first && v[0].first + v[1].first == v[0].second + v[2].second) return true;
    if(v[0].second == v[1].second && v[1].second == v[2].second && v[0].first + v[1].first + v[2].first == v[3].first && v[0].second + v[3].second == v[3].first) return true;
    return false;
}

int main() {
    vector<pair<int, int>> v(4);
    for(int i = 0; i < 4; i++) {
        cin >> v[i].first >> v[i].second;
    }
    bool pos = false;
    sort(v.begin(), v.end());
    do {
        for(int m = 0; m < 16; m++) {
            for(int i = 0; i < 4; i++) {
                if((m >> i) & 1) {
                    swap(v[i].first, v[i].second);
                }
            }
            pos |= check(v);
            for(int i = 0; i < 4; i++) {
                if((m >> i) & 1) {
                    swap(v[i].first, v[i].second);
                }
            }
        }
    } while(next_permutation(v.begin(), v.end()));
    cout << (pos ? 1 : 0) << '\n';
}