#include<bits/stdc++.h>
#include "altar.h"
using namespace std;
#define vec vector
#define pb push_back
#define eb emplace_back
#define siz(vec) ((int)(vec).size())
#define all(vec) (vec).begin(),(vec).end()
template<class T>
void operator +=(vec<T> &a,T b){a.push_back(b);}
template<class T>
void operator --(vec<T> &a){a.pop_back();}
#define pii pair<int,int>
#define x first
#define y second
#define mp make_pair
#define exc(exp) if(exp)continue;
#define stop(exp) if(exp)break;
#define ret(exp) if(exp)return;
#define deb(var) cerr<<#var<<'='<<(var)<<"; "
#define debl(var) cerr<<#var<<'='<<(var)<<";\n"
#define ins insert
#define era erase
#define lb lower_bound
#define ll long long
#define inf (long long)(1e9)
template<class T>
bool Min(T &x,T y){return x>y?x=y,1:0;}
template<class T>
bool Max(T &x,T y){return x<y?x=y,1:0;}

bool sense(int i,int j);
int w[310][310],b[310];
int altar(int n){
    for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            w[i][j]=sense(i,j);
            w[j][i]=w[i][j]^1;
        }
    }
    for(int i=1;i<=n;i++){
        if(count(w[i]+1,w[i]+n+1,1)==n-1){
            return i;
        }
    }
    for(int i=1;i<=n;i++){
        memcpy(b,w[i],sizeof b);
        for(int j=1;j<=n;j++){
            if(w[i][j]){
                for(int k=1;k<=n;k++){
                    if(w[j][k]){
                        b[k]=1;
                    }
                }
            }
        }
        b[i]=1;
        if(count(b+1,b+n+1,1)==n)return i;
    }
}

/*
- CONTINUE, NON-STOPPING, FOR THE FAITH
- START TYPING IF YOU DON'T KNOW WHAT TO DO
- STOP TYPING IF YOU DON'T KNOW WHAT YOU'RE DOING
*/