#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200111;
bool Vis_O;
int N;
int Co[MAXN];
bool Ani_Win;
struct Pos {
  int x, y, id;
  Pos() {}
  Pos(int _x, int _y, int _id = 0) {
    x = _x;
    y = _y;
    id = _id;
  }
} Zero, Po[MAXN];
bool operator==(Pos A, Pos B) { return A.x == B.x && A.y == B.y; }
bool cmpxy(Pos A, Pos B) {
  if (A.x == B.x) return A.y < B.y;
  return A.x < B.x;
}
Pos operator-(Pos A, Pos B) { return Pos(A.x - B.x, A.y - B.y); }
long long operator*(Pos A, Pos B) { return 1LL * A.x * B.y - 1LL * A.y * B.x; }
namespace Hull {
Pos P[MAXN];
int Pc;
Pos U[MAXN], D[MAXN];
int Uc, Dc;
Pos O[MAXN];
int Oc;
void Clear() {
  Pc = 0;
  Uc = 0;
  Dc = 0;
  Oc = 0;
}
void Push(Pos x[], int c) {
  for (int i = 1; i <= c; ++i) P[++Pc] = x[i];
}
void H() {
  sort(P + 1, P + Pc + 1, cmpxy);
  U[++Uc] = P[1];
  U[++Uc] = P[2];
  for (int i = 3; i <= Pc; ++i) {
    while (Uc > 1 && (P[i] - U[Uc]) * (U[Uc] - U[Uc - 1]) < 0LL) --Uc;
    U[++Uc] = P[i];
  }
  D[++Dc] = P[Pc];
  D[++Dc] = P[Pc - 1];
  for (int i = Pc - 2; i >= 1; --i) {
    while (Dc > 1 && (P[i] - D[Dc]) * (D[Dc] - D[Dc - 1]) < 0LL) --Dc;
    D[++Dc] = P[i];
  }
  for (int i = 1; i <= Uc; ++i) O[++Oc] = U[i];
  for (int i = 2; i < Dc; ++i) O[++Oc] = D[i];
}
void H_s() {
  sort(P + 1, P + Pc + 1, cmpxy);
  U[++Uc] = P[1];
  U[++Uc] = P[2];
  for (int i = 3; i <= Pc; ++i) {
    while (Uc > 1 && (P[i] - U[Uc]) * (U[Uc] - U[Uc - 1]) <= 0LL) --Uc;
    U[++Uc] = P[i];
  }
  D[++Dc] = P[Pc];
  D[++Dc] = P[Pc - 1];
  for (int i = Pc - 2; i >= 1; --i) {
    while (Dc > 1 && (P[i] - D[Dc]) * (D[Dc] - D[Dc - 1]) <= 0LL) --Dc;
    D[++Dc] = P[i];
  }
  for (int i = 1; i <= Uc; ++i) O[++Oc] = U[i];
  for (int i = 2; i < Dc; ++i) O[++Oc] = D[i];
}
bool Win() {
  bool ret = false;
  H_s();
  for (int i = 1; i <= Oc && !ret; ++i) {
    ret |= (O[i].x & 1);
    ret |= (O[i].y & 1);
  }
  return ret;
}
}  // namespace Hull
int main() {
  ios_base::sync_with_stdio(false);
  cin >> N;
  for (int i = 1; i <= N; ++i) {
    cin >> Po[i].x >> Po[i].y;
    Po[i].id = i;
    if (Po[i] == Zero) Vis_O = true;
  }
  if (!Vis_O) {
    ++N;
    Po[N] = Pos(0, 0, N);
  }
  {
    using namespace Hull;
    Clear();
    Push(Po, N);
    H();
    for (int i = 1, c = 1; i <= Oc; ++i, c = -c) {
      if (O[i] == Zero) continue;
      Co[O[i].id] = c;
    }
    Clear();
    for (int i = 1; i <= N; ++i)
      if (Co[i] >= 0) P[++Pc] = Po[i];
    Ani_Win |= Win();
    Clear();
    for (int i = 1; i <= N; ++i)
      if (Co[i] <= 0) P[++Pc] = Po[i];
    Ani_Win |= Win();
  }
  cout << (Ani_Win ? "Ani" : "Borna") << endl;
  return 0;
}
