#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,fast-math,unroll-loops")
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
signed main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  ;
  long long n;
  cin >> n;
  vector<long long> arr(n);
  for (long long &x : arr) cin >> x;
  long long mn = *min_element((arr).begin(), (arr).end()), cnt_mn = 0;
  for (long long &x : arr) cnt_mn += (x == mn);
  cout << (cnt_mn > n / 2 ? "Bob\n" : "Alice\n");
}
