

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

public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int n = sc.nextInt();
		Integer[] d = new Integer[n];
		for (int i = 0; i < n; i++) {
			d[i] = sc.nextInt();
		}

		Arrays.sort(d, Collections.reverseOrder());

		int ans = 1;
		for (int i = 1; i < n; i++) {
			if (d[i - 1] > d[i])
				ans++;
		}
		System.out.println(ans);
	}

} import java.util.Arrays; Arrays java.util import java.util.Collections; Collections 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[] d = new Integer[n];
		for (int i = 0; i < n; i++) {
			d[i] = sc.nextInt();
		}

		Arrays.sort(d, Collections.reverseOrder());

		int ans = 1;
		for (int i = 1; i < n; i++) {
			if (d[i - 1] > d[i])
				ans++;
		}
		System.out.println(ans);
	}

} Main public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int n = sc.nextInt();
		Integer[] d = new Integer[n];
		for (int i = 0; i < n; i++) {
			d[i] = sc.nextInt();
		}

		Arrays.sort(d, Collections.reverseOrder());

		int ans = 1;
		for (int i = 1; i < n; i++) {
			if (d[i - 1] > d[i])
				ans++;
		}
		System.out.println(ans);
	} main {
		Scanner sc = new Scanner(System.in);

		int n = sc.nextInt();
		Integer[] d = new Integer[n];
		for (int i = 0; i < n; i++) {
			d[i] = sc.nextInt();
		}

		Arrays.sort(d, Collections.reverseOrder());

		int ans = 1;
		for (int i = 1; i < n; i++) {
			if (d[i - 1] > d[i])
				ans++;
		}
		System.out.println(ans);
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc Integer[] d = new Integer[n]; d new Integer[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, Collections.reverseOrder()) Arrays.sort Arrays d Collections.reverseOrder() Collections.reverseOrder Collections int ans = 1; ans 1 for (int i = 1; i < n; i++) {
			if (d[i - 1] > d[i])
				ans++;
		} int i = 1; int i = 1; i 1 i < n i n i++ i++ i {
			if (d[i - 1] > d[i])
				ans++;
		} {
			if (d[i - 1] > d[i])
				ans++;
		} if (d[i - 1] > d[i])
				ans++; d[i - 1] > d[i] d[i - 1] d i - 1 i 1 d[i] d i ans++ ans System.out.println(ans) System.out.println System.out System System.out ans String[] args args public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int n = sc.nextInt();
		Integer[] d = new Integer[n];
		for (int i = 0; i < n; i++) {
			d[i] = sc.nextInt();
		}

		Arrays.sort(d, Collections.reverseOrder());

		int ans = 1;
		for (int i = 1; i < n; i++) {
			if (d[i - 1] > d[i])
				ans++;
		}
		System.out.println(ans);
	}

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

		int n = sc.nextInt();
		Integer[] d = new Integer[n];
		for (int i = 0; i < n; i++) {
			d[i] = sc.nextInt();
		}

		Arrays.sort(d, Collections.reverseOrder());

		int ans = 1;
		for (int i = 1; i < n; i++) {
			if (d[i - 1] > d[i])
				ans++;
		}
		System.out.println(ans);
	}

} Main


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

public class Main{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int n = sc.nextInt();
		Integer[] d = new Integer[n];
		for (int i = 0; i < n; i++) {
			d[i] = sc.nextInt();
		}

		Arrays.sort(d, Collections.reverseOrder());

		int ans = 1;
		for (int i = 1; i < n; i++) {
			if (d[i - 1] > d[i])
				ans++;
		}
		System.out.println(ans);
	}

}
