import java.util.*;
import java.lang.Math;

public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		
        int n = sc.nextInt();
      	int ds[] = new int[n+1];
      	int stack;
      	int count = 1;

      	for(int i = 0;i < n;i++) ds[i] = sc.nextInt();
      	ds[n] = 101;
      	Arrays.sort(ds);
      	stack = ds[0];
      	for(int i = 1;i < n;i++){
          if(stack != ds[i]){
            count++;
            stack = ds[i];
          }
        }
      
      	System.out.println(count);
	}
}
/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