import java.util.*;

public class Main{
    public static void main(String[] argc){
        Scanner sc = new Scanner(System.in);
        System.out.println(solve(sc));
    }

    public static int solve(Scanner sc){
        int N = sc.nextInt();
        int[] d = new int[N];

        for(int i=0;i<N;i++){
            d[i] = sc.nextInt();
        }
        Arrays.sort(d);
        int cnt = 1;


        for(int i=1;i<N;i++){
            if(d[i] != d[i-1]) cnt++;
        }

        return cnt;
    }
} import java.util.*; util.* java public class Main{
    public static void main(String[] argc){
        Scanner sc = new Scanner(System.in);
        System.out.println(solve(sc));
    }

    public static int solve(Scanner sc){
        int N = sc.nextInt();
        int[] d = new int[N];

        for(int i=0;i<N;i++){
            d[i] = sc.nextInt();
        }
        Arrays.sort(d);
        int cnt = 1;


        for(int i=1;i<N;i++){
            if(d[i] != d[i-1]) cnt++;
        }

        return cnt;
    }
} Main public static void main(String[] argc){
        Scanner sc = new Scanner(System.in);
        System.out.println(solve(sc));
    } main {
        Scanner sc = new Scanner(System.in);
        System.out.println(solve(sc));
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) System.out.println(solve(sc)) System.out.println System.out System System.out solve(sc) solve sc String[] argc argc public static int solve(Scanner sc){
        int N = sc.nextInt();
        int[] d = new int[N];

        for(int i=0;i<N;i++){
            d[i] = sc.nextInt();
        }
        Arrays.sort(d);
        int cnt = 1;


        for(int i=1;i<N;i++){
            if(d[i] != d[i-1]) cnt++;
        }

        return cnt;
    } solve {
        int N = sc.nextInt();
        int[] d = new int[N];

        for(int i=0;i<N;i++){
            d[i] = sc.nextInt();
        }
        Arrays.sort(d);
        int cnt = 1;


        for(int i=1;i<N;i++){
            if(d[i] != d[i-1]) cnt++;
        }

        return cnt;
    } int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int[] d = new int[N]; d new int[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) Arrays.sort Arrays d int cnt = 1; cnt 1 for(int i=1;i<N;i++){
            if(d[i] != d[i-1]) cnt++;
        } int i=1; int i=1; i 1 i<N i N i++ i++ i {
            if(d[i] != d[i-1]) cnt++;
        } {
            if(d[i] != d[i-1]) cnt++;
        } if(d[i] != d[i-1]) cnt++; d[i] != d[i-1] d[i] d i d[i-1] d i-1 i 1 cnt++ cnt return cnt; cnt Scanner sc sc public class Main{
    public static void main(String[] argc){
        Scanner sc = new Scanner(System.in);
        System.out.println(solve(sc));
    }

    public static int solve(Scanner sc){
        int N = sc.nextInt();
        int[] d = new int[N];

        for(int i=0;i<N;i++){
            d[i] = sc.nextInt();
        }
        Arrays.sort(d);
        int cnt = 1;


        for(int i=1;i<N;i++){
            if(d[i] != d[i-1]) cnt++;
        }

        return cnt;
    }
} public class Main{
    public static void main(String[] argc){
        Scanner sc = new Scanner(System.in);
        System.out.println(solve(sc));
    }

    public static int solve(Scanner sc){
        int N = sc.nextInt();
        int[] d = new int[N];

        for(int i=0;i<N;i++){
            d[i] = sc.nextInt();
        }
        Arrays.sort(d);
        int cnt = 1;


        for(int i=1;i<N;i++){
            if(d[i] != d[i-1]) cnt++;
        }

        return cnt;
    }
} Main
import java.util.*;

public class Main{
    public static void main(String[] argc){
        Scanner sc = new Scanner(System.in);
        System.out.println(solve(sc));
    }

    public static int solve(Scanner sc){
        int N = sc.nextInt();
        int[] d = new int[N];

        for(int i=0;i<N;i++){
            d[i] = sc.nextInt();
        }
        Arrays.sort(d);
        int cnt = 1;


        for(int i=1;i<N;i++){
            if(d[i] != d[i-1]) cnt++;
        }

        return cnt;
    }
}