#include<iostream>
#include<random>
#include<chrono>
#include<vector>
using namespace std;
const int N = 1e4 + 5;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


int a[N][3];
int main(){
    int n;
    cin >> n;
    
    for(int i = 0; i < n; i++){
        for(int j = 0; j < 3; j++){
            cin >> a[i][j];
        }
    }
    vector<int> win_count(4, 0);
    for(int it = 0; it < 20000; it++){
        vector<int> cnt(4, 0);
        for(int i = 0; i < n; i++){
            int x = rng() % 7;
            if(x <= 3){
                cnt[a[i][0]]++;
            } else if(x <= 5){
                cnt[a[i][1]]++;
            } else {
                cnt[a[i][2]]++;
            }
        }
        int mx = 0, winner = -1;
        for(int j = 1; j <= 3; j++){
            if(cnt[j] > mx){
                mx = cnt[j];
                winner = j;
            }
        }
        for(int j = 1; j <= 3; j++){
            if(cnt[j] == mx)win_count[j]++;
        }
    }
    int mx = 0, res = -1;
    for(int i = 1; i <= 3; i++){
        if(win_count[i] > mx){
            mx = win_count[i];
            res = i;
        }
    }
    cout << res << '\n';
}