import java.util.*;
 
class Main {
  
    public static void main(String[] args) {
      
        Scanner sc = new Scanner(System.in);
        int N = Integer.parseInt(sc.next());
        Integer moti[] = new Integer[N];
        int co = 1;
      
      for(int i=0;i<N;i++){
        moti[i] = Integer.parseInt(sc.next());
      }
		Arrays.sort(moti, Collections.reverseOrder());
      
      for(int i= 1;i<N;i++){
        if(moti[i-1]>moti[i]){co++;}
      }

		System.out.print(co);
    }
} import java.util.*; util.* java class Main {
  
    public static void main(String[] args) {
      
        Scanner sc = new Scanner(System.in);
        int N = Integer.parseInt(sc.next());
        Integer moti[] = new Integer[N];
        int co = 1;
      
      for(int i=0;i<N;i++){
        moti[i] = Integer.parseInt(sc.next());
      }
		Arrays.sort(moti, Collections.reverseOrder());
      
      for(int i= 1;i<N;i++){
        if(moti[i-1]>moti[i]){co++;}
      }

		System.out.print(co);
    }
} Main public static void main(String[] args) {
      
        Scanner sc = new Scanner(System.in);
        int N = Integer.parseInt(sc.next());
        Integer moti[] = new Integer[N];
        int co = 1;
      
      for(int i=0;i<N;i++){
        moti[i] = Integer.parseInt(sc.next());
      }
		Arrays.sort(moti, Collections.reverseOrder());
      
      for(int i= 1;i<N;i++){
        if(moti[i-1]>moti[i]){co++;}
      }

		System.out.print(co);
    } main {
      
        Scanner sc = new Scanner(System.in);
        int N = Integer.parseInt(sc.next());
        Integer moti[] = new Integer[N];
        int co = 1;
      
      for(int i=0;i<N;i++){
        moti[i] = Integer.parseInt(sc.next());
      }
		Arrays.sort(moti, Collections.reverseOrder());
      
      for(int i= 1;i<N;i++){
        if(moti[i-1]>moti[i]){co++;}
      }

		System.out.print(co);
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = Integer.parseInt(sc.next()); N Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc Integer moti[] = new Integer[N]; moti new Integer[N] N int co = 1; co 1 for(int i=0;i<N;i++){
        moti[i] = Integer.parseInt(sc.next());
      } int i=0; int i=0; i 0 i<N i N i++ i++ i {
        moti[i] = Integer.parseInt(sc.next());
      } {
        moti[i] = Integer.parseInt(sc.next());
      } moti[i] = Integer.parseInt(sc.next()) moti[i] moti i Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc Arrays.sort(moti, Collections.reverseOrder()) Arrays.sort Arrays moti Collections.reverseOrder() Collections.reverseOrder Collections for(int i= 1;i<N;i++){
        if(moti[i-1]>moti[i]){co++;}
      } int i= 1; int i= 1; i 1 i<N i N i++ i++ i {
        if(moti[i-1]>moti[i]){co++;}
      } {
        if(moti[i-1]>moti[i]){co++;}
      } if(moti[i-1]>moti[i]){co++;} moti[i-1]>moti[i] moti[i-1] moti i-1 i 1 moti[i] moti i {co++;} co++ co System.out.print(co) System.out.print System.out System System.out co String[] args args
import java.util.*;
 
class Main {
  
    public static void main(String[] args) {
      
        Scanner sc = new Scanner(System.in);
        int N = Integer.parseInt(sc.next());
        Integer moti[] = new Integer[N];
        int co = 1;
      
      for(int i=0;i<N;i++){
        moti[i] = Integer.parseInt(sc.next());
      }
		Arrays.sort(moti, Collections.reverseOrder());
      
      for(int i= 1;i<N;i++){
        if(moti[i-1]>moti[i]){co++;}
      }

		System.out.print(co);
    }
}