#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const long long MOD = 1e9 + 7;
const long long MAXN = 4e5 + 10;
const int INF = 0x3f3f3f3f;
const long long ll_INF = 9223372036854775807;
long long qm(long long a, long long b) {
  long long ret = 1;
  while (b) {
    if (b & 1) ret = ret * a % MOD;
    a = a * a % MOD;
    b >>= 1;
  }
  return ret;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
int n;
int a[MAXN];
int main() {
  scanf("%d", &n);
  int num1 = 0;
  int min_number = INF;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    if (a[i] == 1) num1++;
    min_number = min(min_number, a[i]);
  }
  if (num1 == 0) {
    int number = 0;
    for (int i = 1; i <= n; i++) {
      if (min_number == a[i]) number++;
    }
    if (number <= n / 2)
      printf("Alice");
    else
      printf("Bob");
  } else if (num1 > 0 && num1 <= n / 2) {
    printf("Alice");
  } else {
    printf("Bob");
  }
  return 0;
}
