找出數組中出現次數超過數組長度一半的數字

import java.util.*;
public class haha{
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int a[]=new int[n];
        int count=0;
        for(int i=0;i<n;i++){
            a[i]=sc.nextInt();
        }
        Arrays.sort(a);
        for(int i=0;i<n;i++){
            if(a[i]==a[a.length/2]){
                count++;
            }
        }
        if(count>a.length/2){
            System.out.println(a[a.length/2]);
        }else{
            System.out.println(0);
        }
    }
}