Alice and Bob are playing a game with n piles of stones. It is guaranteed that n is an even number. The i-th pile has a_i stones.

Alice and Bob will play a game alternating turns with Alice going first.

On a player's turn, they must choose exactly n/2 nonempty piles and independently remove a positive number of stones from each of the chosen piles. They can remove a different number of stones from the piles in a single turn. The first player unable to make a move loses (when there are less than n/2 nonempty piles).

Given the starting configuration, determine who will win the game.

Input

The first line contains one integer n (2 ≤ n ≤ 50) — the number of piles. It is guaranteed that n is an even number.

The second line contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 50) — the number of stones in the piles.

Output

Print a single string "Alice" if Alice wins; otherwise, print "Bob" (without double quotes).

Examples

Input


2
8 8


Output


Bob


Input


4
3 1 4 1


Output


Alice

Note

In the first example, each player can only remove stones from one pile (2/2=1). Alice loses, since Bob can copy whatever Alice does on the other pile, so Alice will run out of moves first.

In the second example, Alice can remove 2 stones from the first pile and 3 stones from the third pile on her first move to guarantee a win.
import java.util.Scanner ;
public class Contest2 {
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        
        int count = 0 ;
        int countOnes = 0 ;
        boolean x = true;
        int[] a = new int [n];
        int[] memory = new int [51];
        a[0] = sc.nextInt();
        for ( int i=1 ; i<n ; i++){
            a[i] = sc.nextInt();
            if(a[i] != a[0]){
                x = false ;
                count ++ ;
            }
            if(a[i] == 1){
                countOnes ++ ;
            }
            memory[a[i]]++;
        }
        memory[a[0]]++;
        if (a[0] == 1) countOnes++;
         for ( int i=0 ; i <memory.length ; i++){
            if (memory[i]>0 && memory[i]<=n/2){
                System.out.println("Alice");
                return;
            }
            if (memory[i]>0 && memory[i]>n/2){
                System.out.println("Bob");
                return;
            }
        }
        if(x == true){
            System.out.println("Bob");
            return;
        }
        if (countOnes > n/2){
            System.out.println("BOb");
            return;
        }
        if (countOnes<=n/2 && countOnes!=0){
            System.out.println("Alice");
            return;
        }
       
        
    }
}
                    