#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
  long long piles;
  cin >> piles;
  vector<long long> amounts(piles);
  for (long long i = (0); i < (piles); i++) cin >> amounts[i];
  sort(amounts.begin(), amounts.end());
  int minim = amounts[0];
  int cant = piles;
  for (long long i = (0); i < (piles); i++) {
    if (amounts[i] != minim) {
      cant = i;
      break;
    }
  }
  if (cant <= piles / 2) {
    cout << "Alice";
  } else {
    cout << "Bob";
  }
  cout << '\n';
}
