#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

struct op {
    int x, y;
} p[N];

int cmp(op x, op y) {
    return 1ll * (x.y - p[1].y) * (y.x - p[1].x) < 1ll * (y.y - p[1].y) * (x.x - p[1].x);
}

int S[N];

signed main() {
    int n, z = 1; scanf("%d", &n);
    if (n == 1) return 0 & puts("Bara");
    if (n == 2) return 0 & puts("Alenka");
    for (int i = 1; i <= n; ++i) {
        scanf("%d%d", &p[i].x, &p[i].y);
        if (p[i].y < p[z].y || (p[i].y == p[z].y && p[i].x < p[z].x)) z = i;
    }
    swap(p[1], p[z]);
    sort(p + 2, p + n + 1, cmp);
    S[++S[0]] = 1;
    for (int i = 2; i <= n; ++i) {
        while (S[0] >= 2 && 1ll * (p[S[S[0]]].x - p[S[S[0] - 1]].x) * (p[i].y - p[S[S[0]]].y) < 1ll * (p[S[S[0]]].y - p[S[S[0] - 1]].y) * (p[i].x - p[S[S[0]]].x)) --S[0];
        S[++S[0]] = i;
    }
    int E = 3 * n - 3 - S[0];
    if (E & 1) puts("Alenka");
    else puts("Bara");
    return 0;
}