import java.util.*;
public class Main {
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int longs[] = new int[n];
		int cnt=0;
		int flag=0;
		
		for(int i=0 ; i<n ; i++) {
			longs[i] = sc.nextInt();
		}
		//For debug
		//for(int i : longs) {
		//	System.out.print(i+" ");
		//}
		sort_small(longs);
		//System.out.println();
		//for(int i : longs) {
		//	System.out.print(i+" ");
		//}
		//System.out.println();
		for(int i=0 ; i<longs.length ; i++) {
			if(flag < longs[i]) {
				cnt++;
				flag = longs[i];
			}
		}
		System.out.println(cnt);
	}
	
	static void sort_big(int[] data) {// �~���ɕ��ёւ���֐�
		int work;
		for(int i=0 ; i<data.length-1 ; i++) {
			for(int k=i+1 ; k<data.length ; k++) {
				if(data[i] < data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			}
		}
	}
	static void sort_small(int[] data) {// �����ɕ��ёւ���֐�
		int work;
		for(int i=0 ; i<data.length-1 ; i++) {
			for(int k=i+1 ; k<data.length ; k++) {
				if(data[i] > data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			}
		}
	}
} import java.util.*; util.* java public class Main {
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int longs[] = new int[n];
		int cnt=0;
		int flag=0;
		
		for(int i=0 ; i<n ; i++) {
			longs[i] = sc.nextInt();
		}
		//For debug
		//for(int i : longs) {
		//	System.out.print(i+" ");
		//}
		sort_small(longs);
		//System.out.println();
		//for(int i : longs) {
		//	System.out.print(i+" ");
		//}
		//System.out.println();
		for(int i=0 ; i<longs.length ; i++) {
			if(flag < longs[i]) {
				cnt++;
				flag = longs[i];
			}
		}
		System.out.println(cnt);
	}
	
	static void sort_big(int[] data) {// �~���ɕ��ёւ���֐�
		int work;
		for(int i=0 ; i<data.length-1 ; i++) {
			for(int k=i+1 ; k<data.length ; k++) {
				if(data[i] < data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			}
		}
	}
	static void sort_small(int[] data) {// �����ɕ��ёւ���֐�
		int work;
		for(int i=0 ; i<data.length-1 ; i++) {
			for(int k=i+1 ; k<data.length ; k++) {
				if(data[i] > data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			}
		}
	}
} Main public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int longs[] = new int[n];
		int cnt=0;
		int flag=0;
		
		for(int i=0 ; i<n ; i++) {
			longs[i] = sc.nextInt();
		}
		//For debug
		//for(int i : longs) {
		//	System.out.print(i+" ");
		//}
		sort_small(longs);
		//System.out.println();
		//for(int i : longs) {
		//	System.out.print(i+" ");
		//}
		//System.out.println();
		for(int i=0 ; i<longs.length ; i++) {
			if(flag < longs[i]) {
				cnt++;
				flag = longs[i];
			}
		}
		System.out.println(cnt);
	} main {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int longs[] = new int[n];
		int cnt=0;
		int flag=0;
		
		for(int i=0 ; i<n ; i++) {
			longs[i] = sc.nextInt();
		}
		//For debug
		//for(int i : longs) {
		//	System.out.print(i+" ");
		//}
		sort_small(longs);
		//System.out.println();
		//for(int i : longs) {
		//	System.out.print(i+" ");
		//}
		//System.out.println();
		for(int i=0 ; i<longs.length ; i++) {
			if(flag < longs[i]) {
				cnt++;
				flag = longs[i];
			}
		}
		System.out.println(cnt);
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int longs[] = new int[n]; longs new int[n] n int cnt=0; cnt 0 int flag=0; flag 0 for(int i=0 ; i<n ; i++) {
			longs[i] = sc.nextInt();
		} int i=0 ; int i=0 ; i 0 i<n i n i++ i++ i {
			longs[i] = sc.nextInt();
		} {
			longs[i] = sc.nextInt();
		} longs[i] = sc.nextInt() longs[i] longs i sc.nextInt() sc.nextInt sc sort_small(longs) sort_small longs for(int i=0 ; i<longs.length ; i++) {
			if(flag < longs[i]) {
				cnt++;
				flag = longs[i];
			}
		} int i=0 ; int i=0 ; i 0 i<longs.length i longs.length longs longs.length i++ i++ i {
			if(flag < longs[i]) {
				cnt++;
				flag = longs[i];
			}
		} {
			if(flag < longs[i]) {
				cnt++;
				flag = longs[i];
			}
		} if(flag < longs[i]) {
				cnt++;
				flag = longs[i];
			} flag < longs[i] flag longs[i] longs i {
				cnt++;
				flag = longs[i];
			} cnt++ cnt flag = longs[i] flag longs[i] longs i System.out.println(cnt) System.out.println System.out System System.out cnt String args[] args static void sort_big(int[] data) {// �~���ɕ��ёւ���֐�
		int work;
		for(int i=0 ; i<data.length-1 ; i++) {
			for(int k=i+1 ; k<data.length ; k++) {
				if(data[i] < data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			}
		}
	} sort_big {// �~���ɕ��ёւ���֐�
		int work;
		for(int i=0 ; i<data.length-1 ; i++) {
			for(int k=i+1 ; k<data.length ; k++) {
				if(data[i] < data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			}
		}
	} int work; work for(int i=0 ; i<data.length-1 ; i++) {
			for(int k=i+1 ; k<data.length ; k++) {
				if(data[i] < data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			}
		} int i=0 ; int i=0 ; i 0 i<data.length-1 i data.length-1 data.length data data.length 1 i++ i++ i {
			for(int k=i+1 ; k<data.length ; k++) {
				if(data[i] < data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			}
		} {
			for(int k=i+1 ; k<data.length ; k++) {
				if(data[i] < data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			}
		} for(int k=i+1 ; k<data.length ; k++) {
				if(data[i] < data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			} int k=i+1 ; int k=i+1 ; k i+1 i 1 k<data.length k data.length data data.length k++ k++ k {
				if(data[i] < data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			} {
				if(data[i] < data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			} if(data[i] < data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				} data[i] < data[k] data[i] data i data[k] data k {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				} work = data[i] work data[i] data i data[i] = data[k] data[i] data i data[k] data k data[k] = work data[k] data k work int[] data data static void sort_small(int[] data) {// �����ɕ��ёւ���֐�
		int work;
		for(int i=0 ; i<data.length-1 ; i++) {
			for(int k=i+1 ; k<data.length ; k++) {
				if(data[i] > data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			}
		}
	} sort_small {// �����ɕ��ёւ���֐�
		int work;
		for(int i=0 ; i<data.length-1 ; i++) {
			for(int k=i+1 ; k<data.length ; k++) {
				if(data[i] > data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			}
		}
	} int work; work for(int i=0 ; i<data.length-1 ; i++) {
			for(int k=i+1 ; k<data.length ; k++) {
				if(data[i] > data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			}
		} int i=0 ; int i=0 ; i 0 i<data.length-1 i data.length-1 data.length data data.length 1 i++ i++ i {
			for(int k=i+1 ; k<data.length ; k++) {
				if(data[i] > data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			}
		} {
			for(int k=i+1 ; k<data.length ; k++) {
				if(data[i] > data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			}
		} for(int k=i+1 ; k<data.length ; k++) {
				if(data[i] > data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			} int k=i+1 ; int k=i+1 ; k i+1 i 1 k<data.length k data.length data data.length k++ k++ k {
				if(data[i] > data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			} {
				if(data[i] > data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			} if(data[i] > data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				} data[i] > data[k] data[i] data i data[k] data k {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				} work = data[i] work data[i] data i data[i] = data[k] data[i] data i data[k] data k data[k] = work data[k] data k work int[] data data public class Main {
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int longs[] = new int[n];
		int cnt=0;
		int flag=0;
		
		for(int i=0 ; i<n ; i++) {
			longs[i] = sc.nextInt();
		}
		//For debug
		//for(int i : longs) {
		//	System.out.print(i+" ");
		//}
		sort_small(longs);
		//System.out.println();
		//for(int i : longs) {
		//	System.out.print(i+" ");
		//}
		//System.out.println();
		for(int i=0 ; i<longs.length ; i++) {
			if(flag < longs[i]) {
				cnt++;
				flag = longs[i];
			}
		}
		System.out.println(cnt);
	}
	
	static void sort_big(int[] data) {// �~���ɕ��ёւ���֐�
		int work;
		for(int i=0 ; i<data.length-1 ; i++) {
			for(int k=i+1 ; k<data.length ; k++) {
				if(data[i] < data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			}
		}
	}
	static void sort_small(int[] data) {// �����ɕ��ёւ���֐�
		int work;
		for(int i=0 ; i<data.length-1 ; i++) {
			for(int k=i+1 ; k<data.length ; k++) {
				if(data[i] > data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			}
		}
	}
} public class Main {
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int longs[] = new int[n];
		int cnt=0;
		int flag=0;
		
		for(int i=0 ; i<n ; i++) {
			longs[i] = sc.nextInt();
		}
		//For debug
		//for(int i : longs) {
		//	System.out.print(i+" ");
		//}
		sort_small(longs);
		//System.out.println();
		//for(int i : longs) {
		//	System.out.print(i+" ");
		//}
		//System.out.println();
		for(int i=0 ; i<longs.length ; i++) {
			if(flag < longs[i]) {
				cnt++;
				flag = longs[i];
			}
		}
		System.out.println(cnt);
	}
	
	static void sort_big(int[] data) {// �~���ɕ��ёւ���֐�
		int work;
		for(int i=0 ; i<data.length-1 ; i++) {
			for(int k=i+1 ; k<data.length ; k++) {
				if(data[i] < data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			}
		}
	}
	static void sort_small(int[] data) {// �����ɕ��ёւ���֐�
		int work;
		for(int i=0 ; i<data.length-1 ; i++) {
			for(int k=i+1 ; k<data.length ; k++) {
				if(data[i] > data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			}
		}
	}
} Main
import java.util.*;
public class Main {
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int longs[] = new int[n];
		int cnt=0;
		int flag=0;
		
		for(int i=0 ; i<n ; i++) {
			longs[i] = sc.nextInt();
		}
		//For debug
		//for(int i : longs) {
		//	System.out.print(i+" ");
		//}
		sort_small(longs);
		//System.out.println();
		//for(int i : longs) {
		//	System.out.print(i+" ");
		//}
		//System.out.println();
		for(int i=0 ; i<longs.length ; i++) {
			if(flag < longs[i]) {
				cnt++;
				flag = longs[i];
			}
		}
		System.out.println(cnt);
	}
	
	static void sort_big(int[] data) {// �~���ɕ��ёւ���֐�
		int work;
		for(int i=0 ; i<data.length-1 ; i++) {
			for(int k=i+1 ; k<data.length ; k++) {
				if(data[i] < data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			}
		}
	}
	static void sort_small(int[] data) {// �����ɕ��ёւ���֐�
		int work;
		for(int i=0 ; i<data.length-1 ; i++) {
			for(int k=i+1 ; k<data.length ; k++) {
				if(data[i] > data[k]) {
					work = data[i];
					data[i] = data[k];
					data[k] = work;
				}
			}
		}
	}
}
