#include<iostream>
#include<cstdio>
#include<algorithm>
#define N 100000
using namespace std;
int read()
{
	char c=0;
	int sum=0,f=1;
	while (c!='-'&&(c<'0'||c>'9')) c=getchar();
	if (c=='-') c=getchar(),f=-1;
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
struct points
{
	int x,y;
	bool operator < (const points &t)const
	{
		return x!=t.x?x<t.x:y<t.y;	
	}
};
points st[N+1],dque[N+1],dque2[N+1];
int n,top,top2;
bool check(points a,points b,points c)
{
	return 1ll*(b.y-a.y)*(c.x-a.x)<=1ll*(c.y-a.y)*(b.x-a.x);
}
bool check2(points a,points b,points c)
{
	return 1ll*(b.y-a.y)*(c.x-a.x)>=1ll*(c.y-a.y)*(b.x-a.x);
}
int main()
{
	n=read();
	for (int i=1;i<=n;++i) st[i].x=read(),st[i].y=read();
	sort(st+1,st+n+1);
	for (int i=1;i<=n;++i)
	{
		while (top>=2&&check(dque[top-1],dque[top],st[i])) top--;
		dque[++top]=st[i];
	}
	for (int i=1;i<=n;++i)
	{
		while (top2>=2&&check2(dque2[top2-1],dque2[top2],st[i])) top2--;
		dque2[++top2]=st[i];
	}
	puts(((top+top2+n)&1)?"Bara":"Alenka");
	return 0;
}