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

public class Main {
	public static void main(String[] args) {
		Main main = new Main();
		main.run();
	}

	int N;
	int d[];
	public void run() {
		Scanner sc = new Scanner(System.in);
		N = sc.nextInt();
		d = new int[N];
		for(int i=0; i<N; i++) d[i] = sc.nextInt();
		Arrays.sort(d);
		int j = uniq(d);
		System.out.println(j);
		sc.close();
	}

	private int uniq(int d[]) {
		int j=1;
		for(int i=1; i<N; i++) {
			if(d[j-1] < d[i]) {
				d[j++] = d[i];
			}
		}
		return j;
	}
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz