#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 7;
const double eps = 1e-9;
int n, k;
bool fl[N], gt[N], ft[N];
struct node {
  long long x, y;
  int w;
} e[N], et[N], q[N];
inline int read() {
  int num = 0;
  char g = getchar();
  while (g < 48 || 57 < g) g = getchar();
  while (47 < g && g < 58)
    num = (num << 1) + (num << 3) + g - 48, g = getchar();
  return num;
}
inline bool equal(double a, double b) {
  if (a - b <= eps && a - b >= -eps) return true;
  return false;
}
inline long long check(node a, node b) { return a.x * b.y - a.y * b.x; }
inline bool cmp(node a, node b) {
  return check(a, b) > 0 ||
         (check(a, b) == 0 && (a.x < b.x || (a.x == b.x && a.y < b.y)));
}
inline node sub(node a, node b) {
  node c;
  c.x = a.x - b.x, c.y = a.y - b.y;
  return c;
}
inline bool solve() {
  int sn = 0;
  for (int i = 1; i <= n; i++)
    if (fl[i]) et[++sn] = e[i];
  k = 0, q[++k] = et[1], q[++k] = et[2];
  et[++sn] = et[1];
  for (int i = 3; i <= sn; i++) {
    while (check(sub(q[k], q[k - 1]), sub(et[i], q[k - 1])) <= eps && k >= 2)
      k--;
    q[++k] = et[i];
  }
  for (int i = 1; i <= k; i++) {
    gt[q[i].w] = 1;
    int a = q[i].x + eps, b = q[i].y + eps;
    if ((a & 1) || (b & 1)) return true;
  }
  if (k == 2) {
    for (int i = n; i >= 1; i--)
      if (fl[i]) {
        int a = e[i].x, b = e[i].y;
        gt[i] = 1;
        if ((a & 1) || (b & 1))
          return true;
        else
          return false;
      }
  }
  return false;
}
int main() {
  cin >> n;
  int f = 1;
  bool fg = 0;
  for (int i = 1; i <= n; i++) {
    e[i].x = read(), e[i].y = read();
    if (e[i].x == 0 && e[i].y == 0) fg = 1;
  }
  if (!fg) n++, e[n].x = 0, e[n].y = 0;
  for (int i = 1; i <= n; i++)
    if (e[i].y < e[f].y)
      f = i;
    else if (e[i].y == e[f].y && e[i].x < e[f].x)
      f = i;
  swap(e[1], e[f]);
  sort(e + 2, e + n + 1, cmp);
  for (int i = 1; i <= n; i++) e[i].w = i, fl[i] = 1;
  if (solve()) {
    puts("Ani");
    return 0;
  }
  for (int i = 2; i <= n; i++) ft[i] = gt[i];
  int a = 0;
  for (int i = 2; i <= n; i++) {
    fl[i] = 1;
    if (ft[i]) {
      a++;
      if (a % 2 == 0) fl[i] = 0;
    }
  }
  if (solve()) {
    puts("Ani");
    return 0;
  }
  a = 0;
  for (int i = 2; i <= n; i++) {
    fl[i] = 1;
    if (ft[i]) {
      a++;
      if (a % 2 == 1) fl[i] = 0;
    }
  }
  if (solve()) {
    puts("Ani");
    return 0;
  }
  puts("Borna");
}
