#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pii pair<int, int>
#define ld long double
#define all(a) (a).begin(), (a).end()

const int MAXN = 10'100;

unsigned char dp[MAXN][MAXN];
short int was[MAXN][MAXN];

vector<pair<int, int>> interesting[2];

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin >> n;
    vector<array<int, 3>> priorities(n);
    /*for (int i = 0; i < n; ++i) {
        priorities[i][0] = 1;
        priorities[i][1] = 2;
        priorities[i][2] = 3;
        random_shuffle(priorities[i].begin(), priorities[i].end());
    }*/
    for (int i = 0; i < n; ++i)
        cin >> priorities[i][0] >> priorities[i][1] >> priorities[i][2];
    for (int a = 0; a <= n; ++a) {
        for (int b = 0; a + b <= n; ++b) {
            int c = n - a - b;
            if (a >= b && a >= c) {
                dp[a][b] = 1;
            } else if (b >= a && b >= c) {
                dp[a][b] = 2;
            } else {
                dp[a][b] = 3;
            }
        }
    }
    for (int a = 0; a <= n; ++a) {
        fill(was[a], was[a] + n + 1, -1);
        for (int b = 0; a + b <= n; ++b) {
            if ((dp[a + 1][b] != 0 && dp[a][b] != dp[a + 1][b]) || (dp[a][b + 1] != 0 && dp[a][b] != dp[a][b + 1]))
                interesting[(n - 1) & 1].emplace_back(a, b);
        }
    }
    vector<int> new_vals;
    for (int i = n - 1; i >= 0; --i) {
        new_vals.resize(interesting[i & 1].size());
        int ids[4];
        ids[0] = 4;
        for (int j = 0; j < 3; ++j)
            ids[priorities[i][j]] = j;

        for (int j = 0; j < interesting[i & 1].size(); ++j) {
            int a = interesting[i & 1][j].first, b = interesting[i & 1][j].second;
            int mn = min(ids[dp[a][b]], min(ids[dp[a + 1][b]], ids[dp[a][b + 1]]));
            new_vals[j] = priorities[i][mn];
        }
        for (int j = 0; j < new_vals.size(); ++j) {
            dp[interesting[i & 1][j].first][interesting[i & 1][j].second] = new_vals[j];
        }
        auto try_checking = [&](int a, int b) {
            if (a >= 0 && b >= 0 && was[a][b] != i) {
                if ((dp[a + 1][b] != 0 && dp[a][b] != dp[a + 1][b]) || (dp[a][b + 1] != 0 && dp[a][b] != dp[a][b + 1])) {
                    interesting[(i & 1) ^ 1].emplace_back(a, b);
                    was[a][b] = i;
                }
            }
        };
        for (auto [a, b] : interesting[i & 1]) {
            try_checking(a, b);
            try_checking(a - 1, b);
            try_checking(a, b - 1);
        }
        interesting[i & 1].clear();
    }
    cout << int(dp[0][0]) << '\n';

    //cerr << clock() * 1.0 / CLOCKS_PER_SEC << '\n';
    return 0;
}