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 A[]= new int[N];
		for (int i=0;i<N;i++) {
			A[i] = sc.nextInt();
		}
		Arrays.parallelSort(A);
		int count =1;
		for (int i=N-1;i>0;i--) {
			if (A[i]!=A[i-1]) {
				count ++;
			}
		}
		System.out.println(count);
	}
} import java.util.Arrays; Arrays 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();
		int A[]= new int[N];
		for (int i=0;i<N;i++) {
			A[i] = sc.nextInt();
		}
		Arrays.parallelSort(A);
		int count =1;
		for (int i=N-1;i>0;i--) {
			if (A[i]!=A[i-1]) {
				count ++;
			}
		}
		System.out.println(count);
	}
} Main public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int A[]= new int[N];
		for (int i=0;i<N;i++) {
			A[i] = sc.nextInt();
		}
		Arrays.parallelSort(A);
		int count =1;
		for (int i=N-1;i>0;i--) {
			if (A[i]!=A[i-1]) {
				count ++;
			}
		}
		System.out.println(count);
	} main {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int A[]= new int[N];
		for (int i=0;i<N;i++) {
			A[i] = sc.nextInt();
		}
		Arrays.parallelSort(A);
		int count =1;
		for (int i=N-1;i>0;i--) {
			if (A[i]!=A[i-1]) {
				count ++;
			}
		}
		System.out.println(count);
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int A[]= new int[N]; A new int[N] N for (int i=0;i<N;i++) {
			A[i] = sc.nextInt();
		} int i=0; int i=0; i 0 i<N i N i++ i++ i {
			A[i] = sc.nextInt();
		} {
			A[i] = sc.nextInt();
		} A[i] = sc.nextInt() A[i] A i sc.nextInt() sc.nextInt sc Arrays.parallelSort(A) Arrays.parallelSort Arrays A int count =1; count 1 for (int i=N-1;i>0;i--) {
			if (A[i]!=A[i-1]) {
				count ++;
			}
		} int i=N-1; int i=N-1; i N-1 N 1 i>0 i 0 i-- i-- i {
			if (A[i]!=A[i-1]) {
				count ++;
			}
		} {
			if (A[i]!=A[i-1]) {
				count ++;
			}
		} if (A[i]!=A[i-1]) {
				count ++;
			} A[i]!=A[i-1] A[i] A i A[i-1] A i-1 i 1 {
				count ++;
			} count ++ count System.out.println(count) System.out.println System.out System System.out count String[] args args public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int A[]= new int[N];
		for (int i=0;i<N;i++) {
			A[i] = sc.nextInt();
		}
		Arrays.parallelSort(A);
		int count =1;
		for (int i=N-1;i>0;i--) {
			if (A[i]!=A[i-1]) {
				count ++;
			}
		}
		System.out.println(count);
	}
} public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int A[]= new int[N];
		for (int i=0;i<N;i++) {
			A[i] = sc.nextInt();
		}
		Arrays.parallelSort(A);
		int count =1;
		for (int i=N-1;i>0;i--) {
			if (A[i]!=A[i-1]) {
				count ++;
			}
		}
		System.out.println(count);
	}
} Main
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 A[]= new int[N];
		for (int i=0;i<N;i++) {
			A[i] = sc.nextInt();
		}
		Arrays.parallelSort(A);
		int count =1;
		for (int i=N-1;i>0;i--) {
			if (A[i]!=A[i-1]) {
				count ++;
			}
		}
		System.out.println(count);
	}
}