import java.util.*;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		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 max = d[0];
		int count = 1;
		for(int k = 1;k < N;k++) {
			if(max > d[k]) {
				max = d[k];
				count++;
			}
		}
		System.out.println(count);
		sc.close();
	}

} import java.util.*; util.* java public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		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 max = d[0];
		int count = 1;
		for(int k = 1;k < N;k++) {
			if(max > d[k]) {
				max = d[k];
				count++;
			}
		}
		System.out.println(count);
		sc.close();
	}

} Main public static void main(String[] args) {
		// TODO Auto-generated method stub
		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 max = d[0];
		int count = 1;
		for(int k = 1;k < N;k++) {
			if(max > d[k]) {
				max = d[k];
				count++;
			}
		}
		System.out.println(count);
		sc.close();
	} main {
		// TODO Auto-generated method stub
		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 max = d[0];
		int count = 1;
		for(int k = 1;k < N;k++) {
			if(max > d[k]) {
				max = d[k];
				count++;
			}
		}
		System.out.println(count);
		sc.close();
	} 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 max = d[0]; max d[0] d 0 int count = 1; count 1 for(int k = 1;k < N;k++) {
			if(max > d[k]) {
				max = d[k];
				count++;
			}
		} int k = 1; int k = 1; k 1 k < N k N k++ k++ k {
			if(max > d[k]) {
				max = d[k];
				count++;
			}
		} {
			if(max > d[k]) {
				max = d[k];
				count++;
			}
		} if(max > d[k]) {
				max = d[k];
				count++;
			} max > d[k] max d[k] d k {
				max = d[k];
				count++;
			} max = d[k] max d[k] d k count++ count System.out.println(count) System.out.println System.out System System.out count sc.close() sc.close sc String[] args args public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		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 max = d[0];
		int count = 1;
		for(int k = 1;k < N;k++) {
			if(max > d[k]) {
				max = d[k];
				count++;
			}
		}
		System.out.println(count);
		sc.close();
	}

} public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		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 max = d[0];
		int count = 1;
		for(int k = 1;k < N;k++) {
			if(max > d[k]) {
				max = d[k];
				count++;
			}
		}
		System.out.println(count);
		sc.close();
	}

} Main
import java.util.*;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		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 max = d[0];
		int count = 1;
		for(int k = 1;k < N;k++) {
			if(max > d[k]) {
				max = d[k];
				count++;
			}
		}
		System.out.println(count);
		sc.close();
	}

}
