Alice and Bob are playing a game with n piles of stones. It is guaranteed that n is an even number. The i-th pile has a_i stones.

Alice and Bob will play a game alternating turns with Alice going first.

On a player's turn, they must choose exactly n/2 nonempty piles and independently remove a positive number of stones from each of the chosen piles. They can remove a different number of stones from the piles in a single turn. The first player unable to make a move loses (when there are less than n/2 nonempty piles).

Given the starting configuration, determine who will win the game.

Input

The first line contains one integer n (2 ≤ n ≤ 50) — the number of piles. It is guaranteed that n is an even number.

The second line contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 50) — the number of stones in the piles.

Output

Print a single string "Alice" if Alice wins; otherwise, print "Bob" (without double quotes).

Examples

Input


2
8 8


Output


Bob


Input


4
3 1 4 1


Output


Alice

Note

In the first example, each player can only remove stones from one pile (2/2=1). Alice loses, since Bob can copy whatever Alice does on the other pile, so Alice will run out of moves first.

In the second example, Alice can remove 2 stones from the first pile and 3 stones from the third pile on her first move to guarantee a win.
#include <bits/stdc++.h>
using namespace std;
template <typename T>
using V = vector<T>;
template <typename T>
using VV = vector<V<T>>;
template <typename T>
using Mi = map<long long, T>;
template <typename T>
using MMi = map<long long, Mi<T>>;
const double PI = 3.141592653589793238463;
void cinArr(vector<long long> &arr) {
  for (int i = 0; i < arr.size(); i++) {
    cin >> arr[i];
  }
}
void cinArr(V<int> &arr) {
  for (int i = 0; i < arr.size(); i++) {
    cin >> arr[i];
  }
}
int xx[4] = {1, -1, 0, 0};
int yy[4] = {0, 0, 1, -1};
vector<long long> prim;
vector<long long> prims;
void er() {
  long long n = 1e6;
  prim = vector<long long>(n + 1);
  for (int i = 0; i <= n; i++) {
    prim[i] = i;
  }
  for (long long i = 2; i <= n; i++) {
    if (prim[i] == i) {
      prims.push_back(i);
      for (long long j = i * i; j <= n; j += i) {
        if (prim[j] == j) {
          prim[j] = i;
        }
      }
    }
  }
}
class Node {
 private:
  long long value = 0;
  long long ind = -1;
  void merge() {
    if (lChildren->value > rChildren->value) {
      value = lChildren->value;
      ind = lChildren->ind;
    } else {
      value = rChildren->value;
      ind = rChildren->ind;
    }
  }
  Node(long long l, long long r, vector<long long> &arr) {
    this->l = l;
    this->r = r;
    if (l == r) {
      value = arr[l];
      ind = l;
    } else {
      long long mid = (l + r) / 2;
      lChildren = new Node(l, mid, arr);
      rChildren = new Node(mid + 1, r, arr);
      merge();
    }
  }

 public:
  long long l;
  long long r;
  Node *lChildren;
  Node *rChildren;
  Node(vector<long long> &arr) : Node(0, arr.size() - 1, arr) {}
  long long getValue() { return value; }
  pair<long long, long long> getInd(long long l, long long r) {
    if (l == this->l && r == this->r) {
      return {value, ind};
    }
    long long mid = (this->l + this->r) / 2;
    pair<long long, long long> ansl = {-1, -1}, ansr = {-1, -1};
    if (l <= mid) {
      ansl = lChildren->getInd(l, min(mid, r));
    }
    if (r > mid) {
      ansr = rChildren->getInd(max(mid + 1, l), r);
    }
    if (ansl.first > ansr.first) {
      return ansl;
    } else {
      return ansr;
    }
  }
  long long getValue(long long ind) {
    if (l == r) {
      return getValue();
    }
    long long mid = (l + r) / 2;
    if (ind <= mid) {
      return lChildren->getValue(ind);
    } else {
      return rChildren->getValue(ind);
    }
  }
  void update(long long l, long long r, long long value) {
    if (l == this->l && r == this->r) {
      return;
    }
    long long mid = (this->l + this->r) / 2;
    if (l <= mid) {
      lChildren->update(l, min(mid, r), value);
    }
    if (r > mid) {
      rChildren->update(max(mid + 1, l), r, value);
    }
    merge();
  }
};
long long gcd(long long a, long long b) {
  if (a < b) {
    swap(a, b);
  }
  if (b == 0) {
    return a;
  }
  return gcd(b, a % b);
}
long long gcd(long long a, long long b, long long &x, long long &y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  long long x1, y1;
  long long d = gcd(b % a, a, x1, y1);
  x = y1 - (b / a) * x1;
  y = x1;
  return d;
}
long long nok(long long a, long long b) {
  long long nnod = gcd(a, b);
  long long ans = a / nnod * b;
  return ans;
}
pair<long long, long long> zero = {-1, -1};
long long divup(long long a, long long b) {
  if (a % b == 0) {
    return a / b;
  } else {
    return a / b + 1;
  }
}
class SNM {
 private:
  vector<long long> parent;
  vector<long long> size;

 public:
  SNM(long long n) {
    parent = vector<long long>(n);
    size = vector<long long>(n, 1);
    for (int i = 0; i < n; i++) {
      parent[i] = i;
    }
  }
  void make_set(int v) { parent[v] = v; }
  int find_set(int v) {
    if (v == parent[v]) return v;
    long long ans = find_set(parent[v]);
    parent[v] = ans;
    return ans;
  }
  void union_sets(int a, int b) {
    a = find_set(a);
    b = find_set(b);
    if (a != b) {
      parent[b] = a;
      size[a] += size[b];
    }
  }
  long long getSize(int v) {
    v = find_set(v);
    return size[v];
  }
};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  vector<long long> arr(n);
  cinArr(arr);
  vector<long long> counter(51, 0);
  for (long long val : arr) {
    counter[val]++;
  }
  bool flag = false;
  for (int i = 1; i < 51; i++) {
    if (counter[i] == 0) {
      continue;
    }
    if (counter[i] >= 1 && counter[i] <= n / 2) {
      flag = true;
    }
    break;
  }
  if (flag) {
    cout << "Alice";
  } else {
    cout << "Bob";
  }
  return 0;
}
