#include <bits/stdc++.h>   using namespace std;   int modInverse(int a, int m);   int gcd(int a, int b);   int power(int x, unsigned int y, unsigned int m);   void pairsort(int a[], int b[], int n);   int logint(int x, int y);   int gcd(int a, int b) {     if (a == 0) return b;     return gcd(b % a, a);   }   int power(int x, unsigned int y, unsigned int m) {     if (y == 0) return 1;     int p = power(x, y / 2, m) % m;     p = (p * p) % m;     return (y % 2 == 0) ? p : (x * p) % m;   }   int modInverse(int a, int m) {     int m0 = m;     int y = 0, x = 1;     if (m == 1) return 0;     while (a > 1) {       int q = a / m;       int t = m;       m = a % m, a = t;       t = y;       y = x - q * y;       x = t;     }     if (x < 0) x += m0;     return x;   }   void pairsort(int a[], int b[], int n) {     pair<int, int> pairt[n];     for (int i = 0; i < n; i++) {       pairt[i].first = a[i];       pairt[i].second = b[i];     }     sort(pairt, pairt + n);     for (int i = 0; i < n; i++) {       a[i] = pairt[i].first;       b[i] = pairt[i].second;     }   }   int logint(int x, int y) {     int ans = 0;     int a = 1;     for (int i = 0; i < x; i++) {       if (x <= a) {         return ans;       }       ans++;       a *= y;     }     return -1;   }   int main() {     ios::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);     int n;     cin >> n;     int mink;     int k = 0;     int a[n];     for (int i = 0; i < n; i++) {       int t;       cin >> t;       a[i] = t;       if (i == 0)         mink = t;       else         mink = min(mink, t);     }     for (int i = 0; i < n; i++) {       int t = a[i];       if (t == mink) k++;     }     if (k > (n / 2)) {       cout <<  Bob ;     } else {       cout <<  Alice ;     }     return 0;   }   