#include <bits/stdc++.h>
#define int long long
#define ll long long
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin() , (x).end()
using namespace std;

int l , w, n;
vector<pair<int,int>> a, b;
bool solve(){
    n = a.size();
    if(n == 0) return true;
    if(n == 1) return false;
    int p = 1; for(int i = 0 ; i < n; i++) p *= 2;
    vector<pair<int,int>> v = a;
    for(int i = 0; i < n ; i++){
        if(v[i].ff == l){
            vector<pair<int,int>> c;
            for(int j = 0;j < n; j++) {
                if(v[j].ff == l ){
                    w -= v[j].ss; continue;
                }
                c.pb(v[i]);
            }
            a = c;
            return solve();
        }
        if(v[i].ss == l){
            vector<pair<int,int>> c;
            for(int j = 0;j < n; j++) {
                if(v[j].ss == l ){
                    w -= v[j].ff; continue;
                }
                c.pb(v[i]);
            }
            a = c;
            return solve();
        }
        if(v[i].ss == w){
            vector<pair<int,int>> c;
            for(int j = 0;j < n; j++) {
                if(v[j].ss == w ){
                    l -= v[j].ff; continue;
                }
                c.pb(v[i]);
            }
            a = c;
            return solve();
        }
        if(v[i].ff == w){
            vector<pair<int,int>> c;
            for(int j = 0;j < n; j++) {
                if(v[j].ff == w){
                    l -= v[j].ss; continue;
                }
                c.pb(v[i]);
            }
            a = c;
            return solve();
        }
    }
    //cout << "here\n";
    sort(all(a));
    do{
        
        //cout << b.size() << endl;
        for(int i = 0 ; i < p ; i++){
            b = a;
            for(int j = 0; j < n; j++){
                if( i & (1 << j) ) swap(b[j].ff , b[j].ss);
            }
            if(n == 2){
                if(b[0].ff + b[1].ff == l && b[1].ss == w && b[0].ss == w) return true;
            }
            else if (n == 3){
                if(b[0].ff + b[1].ff == l && b[1].ss == w && b[1].ff + b[2].ff == l && b[2].ss + b[0].ss == w ) return true;
            }
            else if(b[0].ff + b[1].ff == l && b[1].ss + b[2].ff == w && b[2].ss + b[3].ff == l && b[3].ss + b[0].ss == w ) return  true;
        }
    }while(next_permutation(all(a)));
    return false;
}

vector<pair<int,int>> v(4);
int32_t main() {
    int s = 0;
    for(int i; i < 4; i++){
        cin>>v[i].ff>>v[i].ss;
        s += v[i].ff * v[i].ss;
        //cout << v[i].ff << " " << v[i].ss << endl;
    }
    if((int)sqrt(s) != sqrt(s)){
        cout << 0 << endl; 
        return 0;
    }
    //cout << "here\n" ;
    s = sqrt(s);
    l = w = s;
    for(int i = 0 ; i < 4 ; i++){
        if(v[i].ff == s ){
            w -= v[i].ss; continue;
        }
        if(v[i].ss == s){
            w -= v[i].ff; continue;
        }
        a.pb(v[i]);
    }
    cout << solve() << endl;
}