#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e5 + 5;
const long long mod = 1e9 + 7;
inline long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
long long n;
long long a[maxn];
long long tot = 0;
long long val = 0;
signed main() {
  n = read();
  for (long long i = 1; i <= n; i++) {
    a[i] = read();
  }
  sort(a + 1, a + 1 + n);
  if (a[1] == a[n / 2 + 1]) {
    printf("Bob\n");
  } else
    printf("Alice\n");
  return 0;
}
