import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Set;
import java.util.TreeMap;

public class Main {

    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(
                    System.in));
            int N = Integer.parseInt(br.readLine());

            TreeMap<Integer, Boolean> map = new TreeMap<Integer, Boolean>();

            String[] Aarray = br.readLine().split(" ");
            int A = 0;
            for (int i = 0; i < N; i++) {
                A = Integer.parseInt(Aarray[i]);
                boolean bool = map.containsKey(A);
                if (bool) {
                    map.put(A, true);
                } else {
                    map.put(A, false);
                }
            }

            Set<Integer> aSet = map.keySet();
            int ans = 0;
            for (Integer a : aSet) {
                if (!map.get(a)) {
                    ans++;
                }
            }
            System.out.println(ans);
        } catch (Exception e) {
            System.err.println("Error:" + e.getMessage());
        }
    }

}