#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
const int MAXN = 10000005;
const double eps = 1e-10;
int a[100010], b[1000010];
int v[200010];
int n, h, m;
int p[4];
int dp[50][50][50][50];
int check() {
  if (dp[p[0]][p[1]][p[2]][p[3]] != -1) {
    return dp[p[0]][p[1]][p[2]][p[3]];
  }
  for (int i = 0; i < 4; ++i) {
    for (int j = i + 1; j < 4; ++j) {
      for (int k = 1; k <= p[i]; ++k) {
        for (int l = 1; l <= p[j]; ++l) {
          p[i] -= k;
          p[j] -= l;
          int ret = check();
          p[i] += k;
          p[j] += l;
          if (ret == 0) {
            return dp[p[0]][p[1]][p[2]][p[3]] = 1;
          }
        }
      }
    }
  }
  return dp[p[0]][p[1]][p[2]][p[3]] = 0;
}
int sol() { return 0; }
int main() {
  map<int, int> ft;
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i]);
    ft[a[i]]++;
  }
  int ok = 1;
  if (ft.begin()->second > n / 2) {
    ok = 0;
  }
  if (ok) {
    printf("Alice\n");
  } else {
    printf("Bob\n");
  }
}
