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

#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

#ifdef LOCAL
auto operator<<(auto& o, auto x) -> decltype(x.first, o);
auto operator<<(auto& o, auto x) -> decltype(x.end(), o) {
  o << "{";
  for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y;
  return o << "}";
}
auto operator<<(auto& o, auto x) -> decltype(x.first, o) {
  return o << "(" << x.first << ", " << x.second << ")";
}
void __print(auto... x) { ((cerr << x << " "), ...) << endl; }
#define debug(x...) __print("[" #x "]:", x)
#else
#define debug(...) 2137
#endif


bool czy(pair<int, int> p0, pair<int, int> p1, int x, int y) {
  if(p0.first == p1.second) {
    swap(p1.first, p1.second);
  }
  if(p0.first != p1.first)
    return 0;
  int s0 = p0.first;
  int s1 = p0.second + p1.second;
  if(s0 == x && s1 == y)
    return 1;
  if(s0 == y && s1 == x)
    return 1;
  return 0;
}

bool czy1(pair<int, int> p0, int x, int y) {
  if(x == p0.first && y == p0.second)
    return true;
  if(y == p0.first && x == p0.second)
    return true;
  return false;
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  vector<pair<int, int>> ve(4);
  int sm = 0;
  for(auto &[i, j] : ve) {
    cin >> i >> j;
    sm += i * j;
  }

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

  bool found = 0;

  for(int x = 0; x < bok; x++) {
    sort(all(ve));
    do {
      if(czy(ve[0], ve[1], x, bok) && czy(ve[2], ve[3], bok - x, bok)) {
        found = 1;
      }
    }
    while(next_permutation(all(ve)));
  }

  for(int x = 0; x < bok; x++) {
    for(int y = 0; y < bok; y++) {
      sort(all(ve));
      do {
        bool b0 = czy1(ve[0], x, y);
        bool b1 = czy1(ve[1], bok - x, y);
        bool b2 = czy(ve[2], ve[3], bok, bok - y);
        found |= b0 & b1 & b2;
      }
      while(next_permutation(all(ve)));
    }
  }

  cout << found << endl;
  
}