#include <iostream>
#include <cmath>
#include <iomanip>
#include <vector>

using namespace std;
typedef long long ll;

struct Point{
    ll x, y;
    int idx;

    friend bool operator<(const Point &l, const Point &r){
        return l.idx < r.idx;
    }
    friend bool operator==(const Point &l, const Point &r){
        return l.idx == r.idx;
    }
};

const int N = 100 + 3;
int n;
vector<Point> p;

ll area2(Point a, Point b, Point c){
    return a.x * b.y + b.x * c.y + c.x * a.y - a.x * c.y - b.x * a.y - c.x * b.y;
}

pair<ll, int> smallest(vector<Point> p){
    pair<ll, int> answer;
    answer.first = 2e18;
    for(int i = 0; i < p.size(); ++i){
        int prv = (i - 1 + (int)p.size()) % p.size();
        int nxt = (i + 1) % p.size();

        pair<ll, int> cand;
        cand.first = area2(p[prv], p[i], p[nxt]);
        cand.second = i;
        answer = min(answer, cand);
    }
    return answer;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n;
    p.resize(n);
    for(int i = 0; i < n; ++i){
        cin >> p[i].x >> p[i].y;
        p[i].idx = i + 1;
    }

    cout << "Alberto" << endl;
    for(int turn = 0; turn < n - 2; ++turn){
        if(turn % 2 == 0){
            auto small = smallest(p);
            cout << p[small.second].idx << endl;
            p.erase(p.begin() + small.second);
        }
        else{
            int idx;
            cin >> idx;
            p.erase(find(p.begin(), p.end(), Point{0, 0, idx}));
        }
    }
}