#include <bits/stdc++.h>
using namespace std;
template <typename T>
void maxtt(T& t1, T t2) {
  t1 = max(t1, t2);
}
template <typename T>
void mintt(T& t1, T t2) {
  t1 = min(t1, t2);
}
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
string direc = "RDLU";
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int& x, int y, int mod = 1000000007) {
  assert(y >= 0);
  x += y;
  if (x >= mod) x -= mod;
  assert(x >= 0 && x < mod);
}
void et(int x = -1) {
  printf("%d\n", x);
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 1000000007) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; }
struct Point {
  long long x, y;
  int id;
  Point() {}
  Point(long long x, long long y) : x(x), y(y) {}
  long double abs() const { return hypot(x, y); }
  long double arg() const { return atan2(y, x); }
  Point operator*(double o) const { return Point(x * o, y * o); }
  Point operator+(const Point& o) const { return Point(x + o.x, y + o.y); }
  Point operator-(const Point& o) const { return Point(x - o.x, y - o.y); }
  Point operator/(double o) const { return Point(x / o, y / o); }
  bool operator<(const Point& o) const {
    return x < o.x - 1e-9 || (x < o.x + 1e-9 && y < o.y - 1e-9);
  }
  friend bool operator==(const Point& r1, const Point& r2) {
    return r1.x == r2.x && r1.y == r2.y;
  }
  long long cross(Point b) const { return x * b.y - b.x * y; }
  void readin(int i) {
    id = i;
    scanf("%lld%lld", &x, &y);
  }
};
Point p[200135];
vector<Point> convexNonStrict(vector<Point>& vp) {
  sort(vp.begin(), vp.end());
  int N = unique(vp.begin(), vp.end()) - vp.begin();
  vector<Point> ans1, ans2;
  for (int(i) = 0; (i) < (int)(N); (i)++) {
    while (ans1.size() > 1) {
      Point o = ans1[ans1.size() - 2], a = ans1.back();
      if ((a - o).cross(vp[i] - o) < 0) {
        ans1.pop_back();
      } else
        break;
    }
    ans1.push_back(vp[i]);
  }
  for (int i = N - 1; i >= 0; i--) {
    while (ans2.size() > 1) {
      Point o = ans2[ans2.size() - 2], a = ans2.back();
      if ((a - o).cross(vp[i] - o) < 0) {
        ans2.pop_back();
      } else
        break;
    }
    ans2.push_back(vp[i]);
  }
  for (int i = 1; i < ans2.size() - 1; i++) ans1.push_back(ans2[i]);
  return ans1;
}
vector<Point> convex(vector<Point>& vp) {
  sort(vp.begin(), vp.end());
  int N = unique(vp.begin(), vp.end()) - vp.begin();
  vector<Point> ans1, ans2;
  for (int(i) = 0; (i) < (int)(N); (i)++) {
    while (ans1.size() > 1) {
      Point o = ans1[ans1.size() - 2], a = ans1.back();
      if ((a - o).cross(vp[i] - o) <= 0) {
        ans1.pop_back();
      } else
        break;
    }
    ans1.push_back(vp[i]);
  }
  for (int i = N - 1; i >= 0; i--) {
    while (ans2.size() > 1) {
      Point o = ans2[ans2.size() - 2], a = ans2.back();
      if ((a - o).cross(vp[i] - o) <= 0) {
        ans2.pop_back();
      } else
        break;
    }
    ans2.push_back(vp[i]);
  }
  for (int i = 1; i < ans2.size() - 1; i++) ans1.push_back(ans2[i]);
  return ans1;
}
bool vis[200135];
void fmain(int tid) {
  scanf("%d", &n);
  Point O = Point(0, 0);
  O.id = -1;
  for (int(i) = 0; (i) < (int)(n); (i)++) p[i].readin(i);
  for (int(i) = 0; (i) < (int)(n); (i)++) {
    if (p[i].x == 0 && p[i].y == 0) O.id = i;
  }
  vector<Point> tmp;
  if (O.id == -1) tmp.push_back(O);
  for (int(i) = 0; (i) < (int)(n); (i)++) tmp.push_back(p[i]);
  vector<Point> tt = convexNonStrict(tmp);
  int N = tt.size();
  for (int(i) = 0; (i) < (int)(N); (i)++)
    if (tt[i].id != O.id) vis[tt[i].id] = 1;
  assert(tt[0].x == 0 && tt[0].y == 0);
  tmp.clear();
  for (int i = 1; i < N; i += 2) tmp.push_back(tt[i]);
  for (int(i) = 0; (i) < (int)(n); (i)++)
    if (!vis[p[i].id]) tmp.push_back(p[i]);
  if (O.id == -1) tmp.push_back(O);
  vector<Point> vp = convex(tmp);
  for (Point pp : vp) {
    if ((pp.x & 1) || (pp.y & 1)) {
      puts("Ani");
      return;
    }
  }
  tmp.clear();
  for (int i = 2; i < N; i += 2) tmp.push_back(tt[i]);
  for (int(i) = 0; (i) < (int)(n); (i)++)
    if (!vis[p[i].id]) tmp.push_back(p[i]);
  if (O.id == -1) tmp.push_back(O);
  vp = convex(tmp);
  for (Point pp : vp) {
    if ((pp.x & 1) || (pp.y & 1)) {
      puts("Ani");
      return;
    }
  }
  puts("Borna");
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
