#include <bits/stdc++.h>
using namespace std;
#define int long long
int n, a[10010][3];
int c[4], p[4] = {0, 1, 2, 3};
signed main() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i][0] >> a[i][1] >> a[i][2];
		int k = 1;
		for (int j = 2; j >= 0; j--, k *= 1e6)
			c[a[i][j]] += k;
	}
	sort(p + 1, p + 3 + 1, [&](int x, int y) {
		if (c[x] != c[y]) return c[x] > c[y];
		return x < y;
	});
	cout << p[1] << endl;
	return 0;
}