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[] mochi = new int[N];
		for (int i = 0; i < N ; i++) {
			mochi[i] = sc.nextInt();
		}
		Arrays.sort(mochi);

		int total = 1;
		for (int i = 0 ; i < N-1 ; i++) {
			if (mochi[i] < mochi[i+1]) {
				total += 1;
			}
			if (i+1 == N-1) {
				break;
			}
		}
		System.out.println(total);

	}
}

/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