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

public class Main{
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.next());
        Integer[] d = new Integer[n];
        for(int i=0;i<n;i++){
            d[i] = Integer.parseInt(sc.next());
        }
        Arrays.sort(d, Collections.reverseOrder());
        int prev = d[0];
        int cnt =1;
        for(int i=1;i<n;i++){
            if(prev!=d[i]){
                cnt++;
                prev = d[i];
            }else{
                continue;
            }
        }
        System.out.println(cnt);

    }
} import java.util.Arrays; Arrays java.util import java.util.Collections; Collections java.util import java.util.HashMap; HashMap java.util import java.util.Map; Map 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 = Integer.parseInt(sc.next());
        Integer[] d = new Integer[n];
        for(int i=0;i<n;i++){
            d[i] = Integer.parseInt(sc.next());
        }
        Arrays.sort(d, Collections.reverseOrder());
        int prev = d[0];
        int cnt =1;
        for(int i=1;i<n;i++){
            if(prev!=d[i]){
                cnt++;
                prev = d[i];
            }else{
                continue;
            }
        }
        System.out.println(cnt);

    }
} Main public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.next());
        Integer[] d = new Integer[n];
        for(int i=0;i<n;i++){
            d[i] = Integer.parseInt(sc.next());
        }
        Arrays.sort(d, Collections.reverseOrder());
        int prev = d[0];
        int cnt =1;
        for(int i=1;i<n;i++){
            if(prev!=d[i]){
                cnt++;
                prev = d[i];
            }else{
                continue;
            }
        }
        System.out.println(cnt);

    } main {
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.next());
        Integer[] d = new Integer[n];
        for(int i=0;i<n;i++){
            d[i] = Integer.parseInt(sc.next());
        }
        Arrays.sort(d, Collections.reverseOrder());
        int prev = d[0];
        int cnt =1;
        for(int i=1;i<n;i++){
            if(prev!=d[i]){
                cnt++;
                prev = d[i];
            }else{
                continue;
            }
        }
        System.out.println(cnt);

    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = Integer.parseInt(sc.next()); n Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc Integer[] d = new Integer[n]; d new Integer[n] n for(int i=0;i<n;i++){
            d[i] = Integer.parseInt(sc.next());
        } int i=0; int i=0; i 0 i<n i n i++ i++ i {
            d[i] = Integer.parseInt(sc.next());
        } {
            d[i] = Integer.parseInt(sc.next());
        } d[i] = Integer.parseInt(sc.next()) d[i] d i Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc Arrays.sort(d, Collections.reverseOrder()) Arrays.sort Arrays d Collections.reverseOrder() Collections.reverseOrder Collections int prev = d[0]; prev d[0] d 0 int cnt =1; cnt 1 for(int i=1;i<n;i++){
            if(prev!=d[i]){
                cnt++;
                prev = d[i];
            }else{
                continue;
            }
        } int i=1; int i=1; i 1 i<n i n i++ i++ i {
            if(prev!=d[i]){
                cnt++;
                prev = d[i];
            }else{
                continue;
            }
        } {
            if(prev!=d[i]){
                cnt++;
                prev = d[i];
            }else{
                continue;
            }
        } if(prev!=d[i]){
                cnt++;
                prev = d[i];
            }else{
                continue;
            } prev!=d[i] prev d[i] d i {
                cnt++;
                prev = d[i];
            } cnt++ cnt prev = d[i] prev d[i] d i {
                continue;
            } continue; System.out.println(cnt) System.out.println System.out System System.out cnt String[] args args public class Main{
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.next());
        Integer[] d = new Integer[n];
        for(int i=0;i<n;i++){
            d[i] = Integer.parseInt(sc.next());
        }
        Arrays.sort(d, Collections.reverseOrder());
        int prev = d[0];
        int cnt =1;
        for(int i=1;i<n;i++){
            if(prev!=d[i]){
                cnt++;
                prev = d[i];
            }else{
                continue;
            }
        }
        System.out.println(cnt);

    }
} public class Main{
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.next());
        Integer[] d = new Integer[n];
        for(int i=0;i<n;i++){
            d[i] = Integer.parseInt(sc.next());
        }
        Arrays.sort(d, Collections.reverseOrder());
        int prev = d[0];
        int cnt =1;
        for(int i=1;i<n;i++){
            if(prev!=d[i]){
                cnt++;
                prev = d[i];
            }else{
                continue;
            }
        }
        System.out.println(cnt);

    }
} Main

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

public class Main{
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.next());
        Integer[] d = new Integer[n];
        for(int i=0;i<n;i++){
            d[i] = Integer.parseInt(sc.next());
        }
        Arrays.sort(d, Collections.reverseOrder());
        int prev = d[0];
        int cnt =1;
        for(int i=1;i<n;i++){
            if(prev!=d[i]){
                cnt++;
                prev = d[i];
            }else{
                continue;
            }
        }
        System.out.println(cnt);

    }
}