#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;


int main() {
#ifdef DEBUG
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#else
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
#endif

  vector<array<int, 2>> arr(4);
  int s = 0;
  for (int i = 0; i < 4; ++i) {
    cin >> arr[i][0] >> arr[i][1];
    s += arr[i][0] * arr[i][1];
  }
  int k = sqrt(s);
  while (k * k > s) --k;
  while ((k + 1) * (k + 1) <= s) ++k;
  if (k * k != s) {
    cout << "0\n";
    return 0;
  }

  vector<int> ord = {0, 1, 2, 3};
  do {
    for (int mask = 0; mask < 16; ++mask) {
      int x = k, y = k;
      for (int i = 0; i < 4; ++i) {
        int lx = arr[ord[i]][0], ly = arr[ord[i]][1];
        if (mask & (1 << i)) {
          swap(lx, ly);
        }
        if (x == lx) {
          y -= ly;
        } else if (y == ly) {
          x -= lx;
        } else {
          break;
        }
      }
      if (x == 0 || y == 0) {
        cout << "1\n";
        return 0;
      }
      vector<array<int, 2>> cur(4);
      for (int i = 0; i < 4; ++i) {
        cur[i] = arr[ord[i]];
        if (mask & (1 << i)) {
          swap(cur[i][0], cur[i][1]);
        }
      }
      if (cur[0][0] + cur[1][0] == k && cur[0][1] == cur[1][1] && cur[2][0] + cur[3][0] == k && cur[2][1] == cur[3][1]) {
        cout << "1\n";
        return 0;
      }
    }
  } while (next_permutation(ord.begin(), ord.end()));
  cout << "0\n";
  return 0;
}