#include <bits/stdc++.h>
#include "altar.h"

using namespace std;

const int N = 305;

int deg[N];

int altar(int n) {
    int now = 1;
    for (int i = 2; i <= n; ++i) {
        if (sense(i, now)) now = i;
    }
    vector<int> z = {now};
    for (int i = 1; i <= n; ++i) {
        if (i != now && sense(i, now)) z.push_back(i);
    }
    for (int i = 1; i <= n; ++i) deg[i] = 0;
    for (auto vi : z) {
        for (auto vj : z) {
            if (vi < vj) {
                if (sense(vi, vj)) ++deg[vi];
                else ++deg[vj];
            }
        }
    }
	return max_element(deg + 1, deg + n + 1) - deg;
}