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

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        Integer[] d = new Integer[n];
        for (int i = 0; i < n; i++) {
            d[i] = sc.nextInt();
        }

        Arrays.sort(d, Collections.reverseOrder());
        int stack = 0;
        int top = 100;
        for (int i = 0; i < d.length; i++) {
            if (i == 0 || top > d[i]) {
                top = d[i];
                stack++;
            }
        }
        System.out.println(stack);
    }

} import java.util.Arrays; Arrays java.util import java.util.Collections; Collections java.util import java.util.Scanner; Scanner java.util public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        Integer[] d = new Integer[n];
        for (int i = 0; i < n; i++) {
            d[i] = sc.nextInt();
        }

        Arrays.sort(d, Collections.reverseOrder());
        int stack = 0;
        int top = 100;
        for (int i = 0; i < d.length; i++) {
            if (i == 0 || top > d[i]) {
                top = d[i];
                stack++;
            }
        }
        System.out.println(stack);
    }

} Main public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        Integer[] d = new Integer[n];
        for (int i = 0; i < n; i++) {
            d[i] = sc.nextInt();
        }

        Arrays.sort(d, Collections.reverseOrder());
        int stack = 0;
        int top = 100;
        for (int i = 0; i < d.length; i++) {
            if (i == 0 || top > d[i]) {
                top = d[i];
                stack++;
            }
        }
        System.out.println(stack);
    } main {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        Integer[] d = new Integer[n];
        for (int i = 0; i < n; i++) {
            d[i] = sc.nextInt();
        }

        Arrays.sort(d, Collections.reverseOrder());
        int stack = 0;
        int top = 100;
        for (int i = 0; i < d.length; i++) {
            if (i == 0 || top > d[i]) {
                top = d[i];
                stack++;
            }
        }
        System.out.println(stack);
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc Integer[] d = new Integer[n]; d new Integer[n] n for (int i = 0; i < n; i++) {
            d[i] = sc.nextInt();
        } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
            d[i] = sc.nextInt();
        } {
            d[i] = sc.nextInt();
        } d[i] = sc.nextInt() d[i] d i sc.nextInt() sc.nextInt sc Arrays.sort(d, Collections.reverseOrder()) Arrays.sort Arrays d Collections.reverseOrder() Collections.reverseOrder Collections int stack = 0; stack 0 int top = 100; top 100 for (int i = 0; i < d.length; i++) {
            if (i == 0 || top > d[i]) {
                top = d[i];
                stack++;
            }
        } int i = 0; int i = 0; i 0 i < d.length i d.length d d.length i++ i++ i {
            if (i == 0 || top > d[i]) {
                top = d[i];
                stack++;
            }
        } {
            if (i == 0 || top > d[i]) {
                top = d[i];
                stack++;
            }
        } if (i == 0 || top > d[i]) {
                top = d[i];
                stack++;
            } i == 0 || top > d[i] i == 0 i 0 top > d[i] top d[i] d i {
                top = d[i];
                stack++;
            } top = d[i] top d[i] d i stack++ stack System.out.println(stack) System.out.println System.out System System.out stack String[] args args public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        Integer[] d = new Integer[n];
        for (int i = 0; i < n; i++) {
            d[i] = sc.nextInt();
        }

        Arrays.sort(d, Collections.reverseOrder());
        int stack = 0;
        int top = 100;
        for (int i = 0; i < d.length; i++) {
            if (i == 0 || top > d[i]) {
                top = d[i];
                stack++;
            }
        }
        System.out.println(stack);
    }

} public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        Integer[] d = new Integer[n];
        for (int i = 0; i < n; i++) {
            d[i] = sc.nextInt();
        }

        Arrays.sort(d, Collections.reverseOrder());
        int stack = 0;
        int top = 100;
        for (int i = 0; i < d.length; i++) {
            if (i == 0 || top > d[i]) {
                top = d[i];
                stack++;
            }
        }
        System.out.println(stack);
    }

} Main
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        Integer[] d = new Integer[n];
        for (int i = 0; i < n; i++) {
            d[i] = sc.nextInt();
        }

        Arrays.sort(d, Collections.reverseOrder());
        int stack = 0;
        int top = 100;
        for (int i = 0; i < d.length; i++) {
            if (i == 0 || top > d[i]) {
                top = d[i];
                stack++;
            }
        }
        System.out.println(stack);
    }

}
