#include <bits/stdc++.h>
using namespace std;
const double ep = 1e-8;
const double pi = 3.14159265358979323846264338327950288L;
struct pnt {
  int x, y;
  pnt(int x = 0, int y = 0) : x(x), y(y) {}
  pnt operator+(const pnt &b) { return pnt(x + b.x, y + b.y); }
  pnt operator-(const pnt &b) { return pnt(x - b.x, y - b.y); }
  long long operator&(const pnt &b) { return 1ll * x * b.x + 1ll * y * b.y; }
  long long operator^(const pnt &b) { return 1ll * x * b.y - 1ll * b.x * y; }
  bool operator<(const pnt &b) const { return x != b.x ? x < b.x : y < b.y; }
  bool operator!=(const pnt &b) const { return (x != b.x) || (y != b.y); }
  void input() { scanf("%d %d", &x, &y); }
};
void convexhull(vector<pnt> &p, vector<pnt> &rlt) {
  sort(p.begin(), p.end());
  int n = p.size();
  rlt.clear();
  for (int i = 0, j = 0; i < n; i++) {
    while (j > 1 && (rlt[j - 1] - rlt[j - 2] ^ p[i] - rlt[j - 2]) <= 0)
      rlt.pop_back(), j--;
    rlt.push_back(p[i]), j++;
  }
  int m = rlt.size();
  for (int i = n - 2, j = m; i >= 0; i--) {
    while (j > m && (rlt[j - 1] - rlt[j - 2] ^ p[i] - rlt[j - 2]) <= 0)
      rlt.pop_back(), j--;
    rlt.push_back(p[i]), j++;
  }
  if (n > 1) rlt.pop_back();
}
bool cmp(pnt a, pnt b) { return 1ll * a.y * b.x < 1ll * a.x * b.y; }
bool check(vector<pnt> a) {
  for (auto p : a) {
    if ((p.x & 1) || (p.y & 1)) return 1;
  }
  return 0;
}
vector<pnt> a;
int n;
vector<pnt> b;
vector<pnt> rlt;
int f[200020];
int main() {
  scanf("%d", &n);
  a.push_back(pnt(0, 0));
  pnt p;
  while (n--) {
    p.input();
    if (p != pnt(0, 0)) a.push_back(p);
  }
  n = a.size() - 1;
  sort(a.begin() + 1, a.end(), cmp);
  b = a;
  convexhull(b, rlt);
  assert(rlt[0].x == 0 && rlt[0].y == 0);
  sort(rlt.begin() + 1, rlt.end(), cmp);
  if (check(rlt)) {
    puts("Ani");
    return 0;
  }
  int m = rlt.size() - 1;
  for (int j = 1, i = 1; j <= m; j++) {
    while (a[i] != rlt[j]) i++;
    f[j] = i;
  }
  f[0] = 1;
  f[m + 1] = n;
  for (int j = 1; j <= m; j++) {
    b.clear();
    b.push_back(pnt(0, 0));
    for (int i = f[j - 1]; i < f[j]; i++) b.push_back(a[i]);
    for (int i = f[j] + 1; i <= f[j + 1]; i++) b.push_back(a[i]);
    convexhull(b, rlt);
    if (check(rlt)) {
      puts("Ani");
      return 0;
    }
  }
  puts("Borna");
}
