import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		Integer[] a = new Integer[N];
		for(int i = 0;i<N;i++) {
			a[i]=sc.nextInt();
		}
		Arrays.sort(a,Comparator.reverseOrder());
		int count = 1;
		for(int c = 0;c<a.length-1;c++) {
			if(a[c]>a[c+1]) {
			count++;	
			}
		}
		System.out.print(count);
	}
} import java.util.Arrays; Arrays java.util import java.util.Comparator; Comparator 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[] a = new Integer[N];
		for(int i = 0;i<N;i++) {
			a[i]=sc.nextInt();
		}
		Arrays.sort(a,Comparator.reverseOrder());
		int count = 1;
		for(int c = 0;c<a.length-1;c++) {
			if(a[c]>a[c+1]) {
			count++;	
			}
		}
		System.out.print(count);
	}
} Main public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		Integer[] a = new Integer[N];
		for(int i = 0;i<N;i++) {
			a[i]=sc.nextInt();
		}
		Arrays.sort(a,Comparator.reverseOrder());
		int count = 1;
		for(int c = 0;c<a.length-1;c++) {
			if(a[c]>a[c+1]) {
			count++;	
			}
		}
		System.out.print(count);
	} main {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		Integer[] a = new Integer[N];
		for(int i = 0;i<N;i++) {
			a[i]=sc.nextInt();
		}
		Arrays.sort(a,Comparator.reverseOrder());
		int count = 1;
		for(int c = 0;c<a.length-1;c++) {
			if(a[c]>a[c+1]) {
			count++;	
			}
		}
		System.out.print(count);
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc Integer[] a = new Integer[N]; a new Integer[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.sort(a,Comparator.reverseOrder()) Arrays.sort Arrays a Comparator.reverseOrder() Comparator.reverseOrder Comparator int count = 1; count 1 for(int c = 0;c<a.length-1;c++) {
			if(a[c]>a[c+1]) {
			count++;	
			}
		} int c = 0; int c = 0; c 0 c<a.length-1 c a.length-1 a.length a a.length 1 c++ c++ c {
			if(a[c]>a[c+1]) {
			count++;	
			}
		} {
			if(a[c]>a[c+1]) {
			count++;	
			}
		} if(a[c]>a[c+1]) {
			count++;	
			} a[c]>a[c+1] a[c] a c a[c+1] a c+1 c 1 {
			count++;	
			} count++ count System.out.print(count) System.out.print 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();
		Integer[] a = new Integer[N];
		for(int i = 0;i<N;i++) {
			a[i]=sc.nextInt();
		}
		Arrays.sort(a,Comparator.reverseOrder());
		int count = 1;
		for(int c = 0;c<a.length-1;c++) {
			if(a[c]>a[c+1]) {
			count++;	
			}
		}
		System.out.print(count);
	}
} public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		Integer[] a = new Integer[N];
		for(int i = 0;i<N;i++) {
			a[i]=sc.nextInt();
		}
		Arrays.sort(a,Comparator.reverseOrder());
		int count = 1;
		for(int c = 0;c<a.length-1;c++) {
			if(a[c]>a[c+1]) {
			count++;	
			}
		}
		System.out.print(count);
	}
} Main
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		Integer[] a = new Integer[N];
		for(int i = 0;i<N;i++) {
			a[i]=sc.nextInt();
		}
		Arrays.sort(a,Comparator.reverseOrder());
		int count = 1;
		for(int c = 0;c<a.length-1;c++) {
			if(a[c]>a[c+1]) {
			count++;	
			}
		}
		System.out.print(count);
	}
}