#include <bits/stdc++.h>
 
using namespace std;
#define getbit(n, i) (((n) & (1LL << (i))) != 0) 
#define setbit0(n, i) ((n) & (~(1LL << (i)))) 
#define setbit1(n, i) ((n) | (1LL << (i))) 
#define togglebit(n, i) ((n) ^ (1LL << (i))) 
#define lastone(n) ((n) & (-(n))) 
char gap = 32;
#define int long long
#define ii pair<int, int>

#define ll long long 
#define lll __int128_t
#define pb push_back

bool put(vector<vector<bool>> &grid, int w, int h) {
    int n = grid.size();
    for (int i=0; i<n; i++) {
        for (int j=0; j<n; j++) {
            if ( grid[i][j] == 0 and i+w-1 < n and j+h-1 < n ) {
                //cout << "Placing at " << i << " " << j << endl; 
                for (int k=0; k<w; k++) for (int m=0; m<h; m++) grid[i+k][j+m] = 1;
                return true;
            }
        }
    }
    return false;
}

void solve() {
    vector<ii> planes;
    int tot_area = 0;
    for (int i=0; i<4; i++) {
        int a, b;
        cin >> a >> b;
        planes.pb({a, b});
        tot_area += a*b;
    }

    int s = sqrt(tot_area);
    if ((s+1)*(s+1) == tot_area) s++;
    if (s * s!= tot_area) {
        cout << 0 << endl;
        return;
    }

    vector<int> order = {0, 1, 2, 3};

    int possible = 0;
    int loop = 0;
    do {
        
        for (int i=0; i<(1<<4); i++) {
            vector<ii> a;
            for (int x: order) a.push_back(planes[x]);
            for (int j=0; j<4; j++) if ( (i>>j) & 1) {
                swap(a[j].first, a[j].second);
            }
            vector< vector<bool> > arr(s, vector<bool> (s));
            int pos = 1;
            for (int j=0; j<4; j++) if (!put(arr, a[j].first, a[j].second)) {
                //cout << "Couldnt place " << j << " " << a[j].first << " " << a[j].second << endl;
                pos = 0;
            }
            
            for (int i=0; i<s; i++) for (int j=0; j<s; j++) if (arr[i][j] == false) pos = 0;

           
                

            if (pos) possible = 1;

            //return ;
        }
        
    } while(next_permutation(order.begin(), order.end()));
    cout << possible << endl;
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    
    solve();
    
}