蓝桥杯 出现次数最多的整数

import java.util.Arrays;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] nums = new int[n];
		for (int i = 0; i < nums.length; i++) {
			nums[i] = sc.nextInt();
		}
//		这个方法适合输出重复的次数
//		int[] arr = new int[10000];
//		for (int i = 0; i < nums.length; i++) {
//			arr[nums[i]]++;
//		}
		Arrays.sort(nums);
		int max = 0;
		int p = -1;
		int time = 0;
		for (int i = 0; i < nums.length-1; i++) {
			if(nums[i] == nums[i+1]){
				time++;
			}else{
				time = 0;
			}
			if(time>max){
				max = time;
				p = i;
			}
		}
		System.out.println(nums[p]);
	}
}