#include <iostream>     // Input/output stream objects
#include <fstream>      // File stream objects
#include <sstream>      // String stream objects
#include <iomanip>      // Input/output manipulators
#include <string>       // String class and functions
#include <vector>       // Dynamic array
#include <list>         // Doubly linked list
#include <set>          // Set container
#include <map>          // Map container
#include <queue>        // Queue container
#include <stack>        // Stack container
#include <algorithm>    // Algorithms on sequences (e.g., sort, find)
#include <cmath>        // Mathematical functions
#include <climits>      // LLONG_MAX, LLONG_MIN
#include <ctime>        // Date and time functions
#include <cstdlib>      // General purpose functions (e.g., memory management)
#include <cstring>      // C-style string functions
#include <cctype>       // Character classification functions
#include <cassert>      // Assert function for debugging
#include <exception>    // Standard exceptions
#include <functional>   // Function objects
#include <iterator>     // Iterator classes
#include <limits>       // Numeric limits
#include <locale>       // Localization and internationalization
#include <numeric>      // Numeric operations (e.g., accumulate)
#include <random>       // Random number generators
#include <stdexcept>    // Standard exception classes
#include <typeinfo>     // Runtime type information
#include <utility>      // Utility components (e.g., std::pair)
#include <bitset>

using namespace std;

#define FOR(i, a, b) for(int i = a; i < (b); i++)
#define FORE(i, a, b) for(int i = a; i <= (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define x first 
#define y second
#define mp make_pair
#define PI 3.141592653
#define compress(coord) sort(all(coord)), coord.resize(unique(all(coord)) - coord.begin())
const double eps = 1e-9; // x < eps (x <= 0) x < -eps (x < 0)
const ll inf = LLONG_MAX;

struct rec {
    int w, h; 
    rec (int w, int h) : w(w), h(h) {}
    void rotate() { swap(w, h); }
    bool operator==(rec r) { return w == r.w && h == r.h; }
};

vector<rec> recs;
int suma;
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
    FOR (i, 0, 4) {
        int tw, th;
        cin >> tw >> th;
        suma += tw * th;
        recs.push_back(rec(tw, th));
    }

    int side = sqrt(suma);
    if (side * side != suma) {
        cout << 0 << endl;
        return 0;
    } 

    for (rec cr: recs) if (cr.w > side || cr.h > side) {
        cout << 0 << endl;
        return 0;
    }

    FOR (rot, 0, 16) {
        vector<rec> crec(recs);
        FOR (i, 0, 4) if ((1 << i) & rot) crec[i].rotate();
        vector<int> ord {0, 1, 2, 3};
        do {
            int sumw = crec[0].w + crec[1].w, sumh = crec[0].h + crec[1].h;
            if (sumw == side && sumh >= side) {
                if (crec[0].h == side) {
                    if (crec[2].w == crec[3].w && crec[3].w == crec[1].w && crec[2].h + crec[3].h + crec[1].h == side)  {
                        cout << 1 << endl;
                        return 0;
                    }
                }
                else if (crec[1].h == side) {
                    if (crec[2].w == crec[3].w && crec[3].w == crec[0].w && crec[2].h + crec[3].h + crec[0].h == side) {
                        cout << 1 << endl;
                        return 0;
                    }
                }
                else {
                    if (crec[2] == rec(crec[1].w, side - crec[1].h) && crec[3] == rec(crec[0].w, side - crec[0].h)) {
                        cout << 1 << endl;
                        return 0;
                    }
                }
            }
            else if (sumh == side && sumw >= side) {
                if (crec[0].w == side) {
                    if (crec[2].h == crec[3].h && crec[3].h == crec[1].h && crec[2].w + crec[3].w + crec[1].w == side) {
                        cout << 1 << endl;
                        return 0;
                    }
                }
                else if (crec[1].w == side) {
                    if (crec[2].h == crec[3].h && crec[3].h == crec[0].h && crec[2].w + crec[3].w + crec[0].w == side) {
                        cout << 1 << endl;
                        return 0;
                    }
                }               
                else {
                    if (crec[2] == rec(side - crec[0].w, crec[0].h) && crec[3] == rec(side - crec[1].w, crec[1].h)) {
                        cout << 1 << endl;
                        return 0;
                    }
                }
            }
            else continue;
        } while (next_permutation(all(ord)));
        cout << 0 << endl;
        return 0;
    }   
}