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


// Source: ecnerwala
// Fast recursion with lambdas
// Use it like:
// auto f = y_combinator([](auto self,....)->return_type{...self(...)});
template <class Fun>
class y_combinator_result {
  Fun fun_;

 public:
  template <class T>
  explicit y_combinator_result(T &&fun) : fun_(std::forward<T>(fun)) {}

  template <class... Args>
  decltype(auto) operator()(Args &&...args) {
    return fun_(std::ref(*this), std::forward<Args>(args)...);
  }
};

template <class Fun>
decltype(auto) y_combinator(Fun &&fun) {
  return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  vector<array<int,2>> sq(4);
  int64_t ar = 0;
  for (auto& a : sq) {
    for (auto& x : a) cin >> x;
    ar += a[0]*a[1];
  }

  int64_t side = 0;
  while(side*side < ar) side++;
  if (side*side != ar) {
    cout << 0;
    return 0;
  }

  vector<vector<int>> grid(side, vector<int>(side));
  auto check = [&](int lx, int rx, int ly, int ry)->bool {
    if (rx > side || ry > side) return false;
    for (int i = lx; i < rx; i++) {
      for (int j = ly; j < ry; j++) {
        if (grid[i][j]) return false;
      }
    }
    return true;
  };

  auto fill = [&](int lx, int rx, int ly, int ry, int c)->void {
    for (int i = lx; i < rx; i++) {
      for (int j = ly; j < ry; j++) {
        grid[i][j] = c;
      }
    }
  };

  bool ans = false;
  for (int m = 0; m < (1<<4) && !ans; m++) {
    for (int b = 0; b < 4;b++) {
      if (m>>b&1) swap(sq[b][0], sq[b][1]);
    }

    ans |= y_combinator([&](auto self, int taken)->bool {
      if (taken+1 == (1<<4)) return true;
      int x = -1, y = -1;
      for (int i = 0; i < side; i++) {
        if (x != -1) break;
        for (int j = 0; j < side; j++) {
          if (y != -1) break;
          if (!grid[i][j])
            x = i, y = j;
        }
      }
      assert(x != -1);

      for (int b = 0; b < 4; b++) {
        if (taken>>b&1) continue;
        if (check(x, x+sq[b][0], y, y+sq[b][1])) {
          fill(x, x+sq[b][0], y, y+sq[b][1], 1);
          if (self(taken^(1<<b))) return true;
          fill(x, x+sq[b][0], y, y+sq[b][1], 0);
        }
      }
      return false;
    })(0);

    for (int b = 0; b < 4;b++) {
      if (m>>b&1) swap(sq[b][0], sq[b][1]);
    }
  }
  
  cout << ans << '\n';
}