#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
struct fastio {
  char s[100000];
  int it, len;
  fastio() { it = len = 0; }
  inline char get() {
    if (it < len) return s[it++];
    it = 0;
    len = fread(s, 1, 100000, stdin);
    if (len == 0)
      return EOF;
    else
      return s[it++];
  }
  bool notend() {
    char c = get();
    while (c == ' ' || c == '\n') c = get();
    if (it > 0) it--;
    return c != EOF;
  }
} _buff;
inline long long getnum() {
  long long r = 0;
  bool ng = 0;
  char c;
  c = _buff.get();
  while (c != '-' && (c < '0' || c > '9')) c = _buff.get();
  if (c == '-') ng = 1, c = _buff.get();
  while (c >= '0' && c <= '9') r = r * 10 + c - '0', c = _buff.get();
  return ng ? -r : r;
}
template <class T>
inline void putnum(T x) {
  if (x < 0) putchar('-'), x = -x;
  register short a[20] = {}, sz = 0;
  while (x) a[sz++] = x % 10, x /= 10;
  if (sz == 0) putchar('0');
  for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);
}
inline char getreal() {
  char c = _buff.get();
  while (c <= 32) c = _buff.get();
  return c;
}
long long qpow(long long x, long long k) {
  return k == 0 ? 1
                : 1ll * qpow(1ll * x * x % mod, k >> 1) * (k & 1 ? x : 1) % mod;
}
struct point {
  long long x, y;
  point(long long X = 0, long long Y = 0) {
    x = X;
    y = Y;
  }
  point operator+(const point &t) const { return point(x + t.x, y + t.y); }
  point operator-(const point &t) const { return point(x - t.x, y - t.y); }
  long long det(const point &t) const { return x * t.y - y * t.x; }
  bool operator<(const point &t) const {
    return make_pair(x, y) < make_pair(t.x, t.y);
  }
  bool check() { return x % 2 == 1 || y % 2 == 1; }
};
const int maxn = 200111;
point a[maxn];
bool ban[maxn];
vector<int> get_chull(int l, int r) {
  vector<int> ret;
  for (int i = l; i <= r; i++) {
    if (ban[i]) continue;
    while (ret.size() >= 1 && a[ret.back()].x == a[i].x &&
           a[i].y >= a[ret.back()].y)
      ret.pop_back();
    while (ret.size() >= 2) {
      int p = ret.back();
      int q = ret[ret.size() - 2];
      if ((a[p] - a[q]).det(a[i] - a[q]) >= 0)
        ret.pop_back();
      else
        break;
    }
    ret.push_back(i);
  }
  return ret;
}
int n;
vector<int> v;
void check(vector<int> v) {
  for (int i = 0; i < v.size(); i++)
    if (a[v[i]].check()) {
      puts("Ani");
      exit(0);
    }
}
void solve() {
  sort(a, a + n);
  v = get_chull(0, n - 1);
  check(v);
  for (int i = 0; i < v.size(); i++) {
    if (a[v[i]].x == 0 && a[v[i]].y == 0) continue;
    int l = 0, r = n - 1;
    if (i > 0) l = v[i - 1];
    if (i + 1 < v.size()) r = v[i + 1];
    ban[v[i]] = 1;
    check(get_chull(l, r));
    ban[v[i]] = 0;
  }
}
int main() {
  n = getnum();
  for (int i = 0; i < n; i++) a[i].x = getnum(), a[i].y = getnum();
  a[n++] = point(0, 0);
  solve();
  for (int i = 0; i < n; i++) swap(a[i].x, a[i].y);
  solve();
  puts("Borna");
  return 0;
}
