#include <bits/stdc++.h>

#define long long long int
#define DEBUG
using namespace std;

// @author: pashka

vector<vector<int>> d;
vector<vector<int>> z;

bool interesting(int i, int j) {
    if (d[i + 1][j] != d[i][j]) return true;
    if (d[i][j + 1] != d[i][j]) return true;
    return false;
}

void print() {
    for (auto &a: d) {
        for (auto x: a) {
            cout << x << " ";
        }
        cout << "\n";
    }
    cout << "\n";
}

int main() {
    ios::sync_with_stdio(false);

    int n;
    cin >> n;
    vector<vector<int>> a(n, vector<int>(3));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < 3; j++) {
            cin >> a[i][j];
            a[i][j]--;
        }
    }

    d.assign(n + 2, vector<int>(n + 2, -1));
    z.assign(n + 2, vector<int>(n + 2, -1));
    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <= n; j++) {
            int k = n - i - j;
            if (k >= 0 && k <= n) {
                if (i >= j && i >= k) {
                    d[i][j] = 0;
                } else if (j >= k) {
                    d[i][j] = 1;
                } else {
                    d[i][j] = 2;
                }
            }
        }
    }

    vector<pair<int, int>> fr;

    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <= n; j++) {
            if (d[i][j] == -1) continue;
            if (interesting(i, j)) fr.push_back({i, j});
        }
    }


//    print();

    for (int t = n - 1; t >= 0; t--) {
        vector<pair<int, int>> nfr;

        vector<pair<pair<int, int>, int>> ch;

        for (auto [i, j]: fr) {
            int r = -1;
            for (int x: a[t]) {
                if (d[i][j + 1] == x || d[i + 1][j] == x || d[i][j] == x) {
                    r = x;
                    break;
                }
            }
            ch.push_back({{i, j}, r});
            int rr = d[i][j];
            d[i][j] = r;
            if (i > 0 && z[i - 1][j] != t && interesting(i - 1, j)) {
                nfr.push_back({i - 1, j});
                z[i - 1][j] = t;
            };
            if (j > 0 && z[i][j - 1] != t && interesting(i, j - 1)) {
                nfr.push_back({i, j - 1});
                z[i][j - 1] = t;
            }
            if (z[i][j] != t && interesting(i, j)) {
                nfr.push_back({i, j});
                z[i][j] = t;
            };
            d[i][j] = rr;
        }
        for (auto [p, r]: ch) {
            auto [i, j] = p;
            d[i][j] = r;
        }

        fr = nfr;
        assert(fr.size() <= 50000);
//        cout << fr.size() << "\n";
//        print();
    }
    cout << d[0][0] + 1 << "\n";

    return 0;
}