import java.util.HashMap; import java.util.Map; import java.util.Scanner; public class N182 { public static void main(String[] args) { Scanner sca = new Scanner(System.in); Map vt = new HashMap(); int n = sca.nextInt(); int[] a = new int[n]; for (int i = 0; i < n; i++) { a[i] = sca.nextInt(); if (vt.containsKey(a[i])) vt.put(a[i], vt.get(a[i]) + 1); else vt.put(a[i], 1); } int C = 0; for (Map.Entry voter : vt.entrySet()) { int S = voter.getValue(); if (S == 1) C++; } System.out.println(C); } }