#include <bits/stdc++.h>
#define MULTI int _; cin >> _; while(_--)
#define fi first
#define se second
#define pb(a) push_back(a)
#define rep(i, n) for(int i = 0; i < n; i++)
#define reps(i, n, m) for(int i = n; i <= m; i++)
#define repsv(i, n, m) for(int i = n; i >= m; i--)
#define vsz(a) (int)(a.size())
#define mp(a, b) make_pair(a, b)
#define all(a) a.begin(), a.end()

using namespace std;

typedef pair<double, double> pdd;
typedef pair<int, int> pii;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vll;

#ifdef LOCAL
#include "debugs.hpp"
#else
#define dbg(...) 0
#endif

struct Vert{
    ld x, y;
    int id;
};
vector<Vert> p;


void enemy(){
    int in;
    cin >> in;
    auto it = p.begin();
    while(it->id != in)
        it++;
    p.erase(it);
}

ld det(ld x1, ld y1, ld x2, ld y2){
    return abs(x1*y2 - x2*y1);
}

ld score(Vert pa, Vert pb, Vert pc){ // finalement c'est juste l'aire, mais je crois que c'est équivalent à l'angle aussi non ? 
    return det(pa.x-pb.x, pa.y-pb.y, pc.x-pb.x, pc.y-pb.y);
}

void play(){
    int n = vsz(p);
    pair<int, ld> best {0, INFINITY};
    rep(i, n){
        ld cs = score(p[(i+n-1)%n], p[i], p[(i+1)%n]);
        if(cs<best.se)
            best = mp(i, cs);
    }
    cout << p[best.fi].id << '\n';
    auto it = p.begin();
    rep(i, best.fi) it++;
    p.erase(it);
}

void solve(){
    int n;
    cin >> n;
    p = vector<Vert>(n);
    rep(i, n){
        cin >> p[i].x >> p[i].y;
        p[i].id = i+1;
    }
    if(n%2){
        cout << "Beatrice\n";
        enemy();
    }
    else
        cout << "Alberto\n";
    while(vsz(p)>=3){
        play();
        if(vsz(p)>=3)
            enemy();
    }
}

int main(){
    ios_base::sync_with_stdio(false);
    // MULTI
    solve();
}