#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #pragma warning(disable:4996) #define ATCODER #ifdef ATCODER #include #endif typedef long long ll; typedef unsigned long long ull; #define LINF 9223300000000000000 #define LINF2 1223300000000000000 #define LINF3 1000000000000 #define INF 2140000000 //const long long MOD = 1000000007; const long long MOD = 998244353; using namespace std; #ifdef ATCODER using namespace atcoder; #endif void solve() { int n; scanf("%d", &n); vector a(n); for (int i = 0; i < n; i++) { scanf("%d", &a[i]); } if (n % 2) { printf("Alice\n"); return; } else { sort(a.begin(), a.end()); for (int i = 0; i < n / 2; i++) { if (a[i * 2] != a[i * 2 + 1]) { printf("Alice\n"); return; } } printf("Bob\n"); return; } return; } int main() { #if 0 solve(); #else int T, t; scanf("%d", &T); for (t = 0; t < T; t++) { //printf("Case #%d: ", t + 1); solve(); } #endif return 0; }