#include <cmath>
#include <cstring>
#include <iostream>
#include <vector>

using namespace std;

const int MAX_LEN = 4000;

struct rect {
  int w, h;
};

bool foundSolution = false;
int board[MAX_LEN][MAX_LEN];
int len;
vector<rect> rects;

bool tryFit(int w, int h, int i, int j, int r) {
  if (i + h > len || j + w > len)
    return false;

  for (int a = 0; a < h; a++) {
    for (int b = 0; b < w; b++) {
      if (board[i + a][b + j] != -1)
        return false;

      board[i + a][b + j] = r;
    }
  }

  return true;
}

void unfit(int w, int h, int i, int j, int r) {
  if (i + h > len || j + w > len)
    return;

  for (int a = 0; a < h; a++) {
    for (int b = 0; b < w; b++) {
      if (board[i + a][b + j] == r)
        board[i + a][b + j] = -1;
    }
  }
}

void bruteForce(int mask) {
  if (mask == (1 << 4) - 1) {
    foundSolution = true;
    return;
  }
  if (foundSolution)
    return;

  int i, j;
  bool found = false;
  for (i = 0; i < len; i++) {
    for (j = 0; j < len; j++) {
      if (board[i][j] == -1) {
        found = true;
        break;
      }
    }
    if (found)
      break;
  }

  for (int r = 0; r < 4; r++) {
    if ((mask & (1 << r)) == 0) {
      bool fit = tryFit(rects[r].w, rects[r].h, i, j, r);
      if (fit)
        bruteForce(mask | (1 << r));
      unfit(rects[r].w, rects[r].h, i, j, r);

      fit = tryFit(rects[r].h, rects[r].w, i, j, r);
      if (fit)
        bruteForce(mask | (1 << r));
      unfit(rects[r].h, rects[r].w, i, j, r);
    }
  }
}

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

  rects.resize(4);

  int area = 0;
  for (int i = 0; i < 4; i++) {
    cin >> rects[i].w >> rects[i].h;
    area += rects[i].w * rects[i].h;
  }

  len = sqrt(area);
  if (len * len != area) {
    cout << 0 << endl;
    return 0;
  }

  memset(board, -1, sizeof(board));
  bruteForce(0);

  cout << foundSolution << endl;
}