import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int height[] = new int[n];
        for(int height_i=0; height_i < n; height_i++){
            height[height_i] = in.nextInt();
        }
        Arrays.sort(height);
        int[] max = new int[n]; int i=0;
        max[i] = height[n-1];
        for(int height_i=n-2; height_i >=0; height_i--){
              if (height[height_i] == max[i]) {
                  max[++i] = height[height_i];
              }
        }
        System.out.println(i+1);
    }
}