#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int a[N];
void solve() {
  int n;
  scanf("%d", &n);
  int mx = 100;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    mx = min(mx, a[i]);
  }
  int cnt = 0;
  for (int i = 1; i <= n; i++) {
    if (mx == a[i]) cnt++;
  }
  if (cnt <= n / 2)
    puts("Alice");
  else
    puts("Bob");
}
int main() {
  solve();
  return 0;
}
