#include <bits/stdc++.h>
using namespace std;
using ui = unsigned int;
using ull = unsigned long long;
using ll = long long;
#define endl '\n'
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int maxn = 2e5 + 10;
const int mod = 1000000007;
#define inl inline
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define ford(i, a, b) for (int i = a; i >= b; i--)
#define forall(i, a) for (auto &i : a)

/**
   ____         ___ _____
  / ___| _   _ / _ \___ /
  \___ \| | | | | | ||_ \
   ___) | |_| | |_| |__) |
  |____/ \__, |\___/____/
         |___/
*/
istream &operator>>(istream &in, vector<int> &v)
{
    for (auto &i : v)
        in >> i;
    return in;
}
ostream &operator<<(ostream &out, vector<int> &v)
{
    for (auto &i : v)
        out << i << " ";
    return out;
}
bool _output = 0;

#define int ll
void solve()
{
    vector<pii> v(4);
    for (int i = 0; i < 4; i++)
    {
        cin >> v[i].first >> v[i].second;
    }
    sort(v.begin(), v.end());
    bool suc = 0;
    for (int msk = 0; msk < (1 << 4); msk++)
    {
        do
        {
            vector<int> a(4), b(a);
            for (int i = 0; i < 4; i++)
            {
                a[i] = v[i].first;
                b[i] = v[i].second;

                if (msk & (1 << i))
                {
                    swap(a[i], b[i]);
                }
            }
            if (a[0] == a[1] && a[2] == a[3] && b[0] + b[1] == b[2] + b[3] && a[0] + a[2] == b[0] + b[1])
            {
                suc = 1;
            }
            if (a[1] == a[2] && a[2] == a[3] && b[0] == b[1] + b[2] + b[3] && a[0] + a[1] == b[0])
            {
                suc = 1;
            }
            if (a[0] + a[1] == a[2] && a[2] == a[3] && b[0] == b[1] && a[0] + a[1] == b[0] + b[2] + b[3])
            {
                suc = 1;
            }
            if (a[0] + a[1] == a[2] && b[0] == b[1] && b[0] + b[2] == b[3] && a[0] + a[1] + a[3] == b[0] + b[2])
            {
                suc = 1;
            }
            if (a[0] == a[1] && a[1] == a[2] && a[2] == a[3] && a[0] == b[0] + b[1] + b[2] + b[3])
            {
                suc = 1;
            }
        } while (next_permutation(v.begin(), v.end()));
    }
    cout << suc << endl;
}

// 十字

// 4条
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int _ = 1;
    if (_output)
        cin >> _;
    while (_--)
        solve();
    return 0;
}