#include <bits/stdc++.h> 

#define ll long long
#define pii pair<ll, ll>
#define X first
#define Y second
#define pb push_back 

using namespace std; 

const int N = 1e6;

int n, pos, stk[N], in[N];
pii point[N];

vector<pair<pii, int>> v;

ll ccw(pii a, pii b, pii c){ 
	return (b.X - a.X) * (c.Y - a.Y) - (c.X - a.X) * (b.Y - a.Y);
}

int main(){ 
	ios_base::sync_with_stdio(false);

	cin >> n;

	for(int i = 0; i < n; i++){ 
		int x, y;
		cin >> x >> y;
		v.pb({{x, y}, i});
		point[i] = {x, y};
	}

	if(n == 1){ 
		cout << "Bara\n";
		return 0;
	}

	sort(v.begin(), v.end());
	for(pair<pii, int> x : v){ 
		while(pos >= 2){ 
			if(ccw(point[stk[pos - 2]], point[stk[pos - 1]], x.X) > 0)
				pos--;
			else 
				break;
		}
		stk[pos++] = x.Y;
	}
	for(int i = 0; i < pos; i++) in[stk[i]] = true;
	
	pos = 0;
	reverse(v.begin(), v.end());
	for(pair<pii, int> x : v){ 
		while(pos >= 2){ 
			if(ccw(point[stk[pos - 2]], point[stk[pos - 1]], x.X) > 0)
				pos--;
			else
				break;
		}
		stk[pos++] = x.Y;
	}
	for(int i = 0; i < pos; i++) in[stk[i]] = true;
	
	int rub = 0;
	for(int i = 0; i < n; i++) rub += in[i];

	int ans = rub + rub - 3 + (n - rub) * 3;
	cout << (ans & 1 ? "Alenka" : "Bara") << "\n";
	return 0;
}