#include <bits/stdc++.h>
using namespace std;
const long long N = 200005;
long long n, Stack[N], tot, flag[N];
struct dot {
  long long x, y;
  dot operator-(const dot &b) const {
    dot z;
    z.x = x - b.x;
    z.y = y - b.y;
    return z;
  }
} A[N];
long long chaji(dot x, dot y) { return x.x * y.y - x.y * y.x; }
long long cmp(dot x, dot y) {
  return chaji(x, y) < 0 || (chaji(x, y) == 0 && (x.y < y.y || x.x < y.x));
}
signed main() {
  scanf("%lld", &n);
  for (long long i = 1; i <= n; i++) scanf("%lld%lld", &A[i].x, &A[i].y);
  sort(A + 1, A + n + 1, cmp);
  Stack[tot = 1] = 0;
  for (long long i = 1; i <= n; i++) {
    while (tot > 1 &&
           chaji(A[Stack[tot]] - A[Stack[tot - 1]], A[i] - A[Stack[tot]]) >= 0)
      tot--;
    Stack[++tot] = i;
  }
  for (long long i = 2; i <= tot; i++)
    if ((A[Stack[i]].x & 1) || (A[Stack[i]].y & 1)) {
      puts("Ani");
      return 0;
    }
  for (long long i = 2; i <= tot; i += 2) flag[Stack[i]] = 1;
  Stack[tot = 1] = 0;
  for (long long i = 1; i <= n; i++)
    if (!flag[i]) {
      while (tot > 1 && chaji(A[Stack[tot]] - A[Stack[tot - 1]],
                              A[i] - A[Stack[tot]]) >= 0)
        tot--;
      Stack[++tot] = i;
    }
  for (long long i = 2; i <= tot; i++)
    if ((A[Stack[i]].x & 1) || (A[Stack[i]].y & 1)) {
      puts("Ani");
      return 0;
    }
  Stack[tot = 1] = 0;
  memset(flag, 0, sizeof flag);
  for (long long i = 1; i <= n; i++) {
    while (tot > 1 &&
           chaji(A[Stack[tot]] - A[Stack[tot - 1]], A[i] - A[Stack[tot]]) >= 0)
      tot--;
    Stack[++tot] = i;
  }
  for (long long i = 3; i <= tot; i += 2) flag[Stack[i]] = 1;
  Stack[tot = 1] = 0;
  for (long long i = 1; i <= n; i++)
    if (!flag[i]) {
      while (tot > 1 && chaji(A[Stack[tot]] - A[Stack[tot - 1]],
                              A[i] - A[Stack[tot]]) >= 0)
        tot--;
      Stack[++tot] = i;
    }
  for (long long i = 2; i <= tot; i++)
    if ((A[Stack[i]].x & 1) || (A[Stack[i]].y & 1)) {
      puts("Ani");
      return 0;
    }
  puts("Borna");
}
