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

public class Main {
	public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        Main m = new Main(sc);
        m.show(m.solve());
        sc.close();
    }
    
	//フィールド
    Scanner sc;
    int N;
    Integer[] d;
    
    //入力
    Main(Scanner sc) {
        this.sc = sc;
        this.N = sc.nextInt();
        d = new Integer[N];
        for (int i = 0; i < N; i++) {
        	this.d[i] = sc.nextInt();
        }
    }
    
    //解答処理
    private int solve() {
        int count = 1;
        Arrays.sort(d, Collections.reverseOrder());

        for (int i = 1; i < N; i++) {
        	if (d[i] < d[i-1]) {
        		count++;
        	}
        }
        
        return count;
    }
    
    //出力
    public void show(int answer) {
        System.out.println(answer);
    }

} 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) throws Exception {
        Scanner sc = new Scanner(System.in);
        Main m = new Main(sc);
        m.show(m.solve());
        sc.close();
    }
    
	//フィールド
    Scanner sc;
    int N;
    Integer[] d;
    
    //入力
    Main(Scanner sc) {
        this.sc = sc;
        this.N = sc.nextInt();
        d = new Integer[N];
        for (int i = 0; i < N; i++) {
        	this.d[i] = sc.nextInt();
        }
    }
    
    //解答処理
    private int solve() {
        int count = 1;
        Arrays.sort(d, Collections.reverseOrder());

        for (int i = 1; i < N; i++) {
        	if (d[i] < d[i-1]) {
        		count++;
        	}
        }
        
        return count;
    }
    
    //出力
    public void show(int answer) {
        System.out.println(answer);
    }

} Main //フィールド
    Scanner sc; sc int N; N Integer[] d; d public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        Main m = new Main(sc);
        m.show(m.solve());
        sc.close();
    } main {
        Scanner sc = new Scanner(System.in);
        Main m = new Main(sc);
        m.show(m.solve());
        sc.close();
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) Main m = new Main(sc); m new Main(sc) m.show(m.solve()) m.show m m.solve() m.solve m sc.close() sc.close sc String[] args args //入力
    Main(Scanner sc) {
        this.sc = sc;
        this.N = sc.nextInt();
        d = new Integer[N];
        for (int i = 0; i < N; i++) {
        	this.d[i] = sc.nextInt();
        }
    } Main {
        this.sc = sc;
        this.N = sc.nextInt();
        d = new Integer[N];
        for (int i = 0; i < N; i++) {
        	this.d[i] = sc.nextInt();
        }
    } this.sc = sc this.sc this this.sc sc this.N = sc.nextInt() this.N this this.N sc.nextInt() sc.nextInt sc d = new Integer[N] d new Integer[N] N for (int i = 0; i < N; i++) {
        	this.d[i] = sc.nextInt();
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
        	this.d[i] = sc.nextInt();
        } {
        	this.d[i] = sc.nextInt();
        } this.d[i] = sc.nextInt() this.d[i] this.d this this.d i sc.nextInt() sc.nextInt sc Scanner sc sc //解答処理
    private int solve() {
        int count = 1;
        Arrays.sort(d, Collections.reverseOrder());

        for (int i = 1; i < N; i++) {
        	if (d[i] < d[i-1]) {
        		count++;
        	}
        }
        
        return count;
    } solve {
        int count = 1;
        Arrays.sort(d, Collections.reverseOrder());

        for (int i = 1; i < N; i++) {
        	if (d[i] < d[i-1]) {
        		count++;
        	}
        }
        
        return count;
    } int count = 1; count 1 Arrays.sort(d, Collections.reverseOrder()) Arrays.sort Arrays d Collections.reverseOrder() Collections.reverseOrder Collections for (int i = 1; i < N; i++) {
        	if (d[i] < d[i-1]) {
        		count++;
        	}
        } int i = 1; int i = 1; i 1 i < N i N i++ i++ i {
        	if (d[i] < d[i-1]) {
        		count++;
        	}
        } {
        	if (d[i] < d[i-1]) {
        		count++;
        	}
        } if (d[i] < d[i-1]) {
        		count++;
        	} d[i] < d[i-1] d[i] d i d[i-1] d i-1 i 1 {
        		count++;
        	} count++ count return count; count //出力
    public void show(int answer) {
        System.out.println(answer);
    } show {
        System.out.println(answer);
    } System.out.println(answer) System.out.println System.out System System.out answer int answer answer public class Main {
	public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        Main m = new Main(sc);
        m.show(m.solve());
        sc.close();
    }
    
	//フィールド
    Scanner sc;
    int N;
    Integer[] d;
    
    //入力
    Main(Scanner sc) {
        this.sc = sc;
        this.N = sc.nextInt();
        d = new Integer[N];
        for (int i = 0; i < N; i++) {
        	this.d[i] = sc.nextInt();
        }
    }
    
    //解答処理
    private int solve() {
        int count = 1;
        Arrays.sort(d, Collections.reverseOrder());

        for (int i = 1; i < N; i++) {
        	if (d[i] < d[i-1]) {
        		count++;
        	}
        }
        
        return count;
    }
    
    //出力
    public void show(int answer) {
        System.out.println(answer);
    }

} public class Main {
	public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        Main m = new Main(sc);
        m.show(m.solve());
        sc.close();
    }
    
	//フィールド
    Scanner sc;
    int N;
    Integer[] d;
    
    //入力
    Main(Scanner sc) {
        this.sc = sc;
        this.N = sc.nextInt();
        d = new Integer[N];
        for (int i = 0; i < N; i++) {
        	this.d[i] = sc.nextInt();
        }
    }
    
    //解答処理
    private int solve() {
        int count = 1;
        Arrays.sort(d, Collections.reverseOrder());

        for (int i = 1; i < N; i++) {
        	if (d[i] < d[i-1]) {
        		count++;
        	}
        }
        
        return count;
    }
    
    //出力
    public void show(int answer) {
        System.out.println(answer);
    }

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

public class Main {
	public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner(System.in);
        Main m = new Main(sc);
        m.show(m.solve());
        sc.close();
    }
    
	//フィールド
    Scanner sc;
    int N;
    Integer[] d;
    
    //入力
    Main(Scanner sc) {
        this.sc = sc;
        this.N = sc.nextInt();
        d = new Integer[N];
        for (int i = 0; i < N; i++) {
        	this.d[i] = sc.nextInt();
        }
    }
    
    //解答処理
    private int solve() {
        int count = 1;
        Arrays.sort(d, Collections.reverseOrder());

        for (int i = 1; i < N; i++) {
        	if (d[i] < d[i-1]) {
        		count++;
        	}
        }
        
        return count;
    }
    
    //出力
    public void show(int answer) {
        System.out.println(answer);
    }

}
