#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
typedef array<int, 3> arr;
int n;
arr a[10005], cur;
int Get(arr res) {
	for (int i = 0; i < 3; i++) {
		bool ok = 1;
		for (int j = 0; j < 3; j++) {
			if (res[i] < res[j]) ok = 0;
		}
		if (ok) return i;
	}
	assert(0);
	return -1;
}
arr dfs(int x) {
	if (x == n + 1) {
		return cur;
	}
	for (int j = 0; j < 3; j++) {
		cur[a[x][j]]++;
		auto res = dfs(x + 1);
		cur[a[x][j]]--;
		if (Get(res) == a[x][j]) {
			return res;
		}
	}
	assert(0);
	return {-1, -1, -1};
}
int main() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j < 3; j++) cin >> a[i][j], a[i][j]--;
	}
	arr res = dfs(1);
	cout << Get(res) + 1;
}