import java.util.*;

public class Main {
	Scanner sc = new Scanner(System.in);
	final int MOD = 1000000007;
	final int MAX = Integer.MAX_VALUE;
	final long LMAX = Long.MAX_VALUE;
	final int LEN = 100000;

	void doIt() {
		int n = sc.nextInt();
		int cnt[] = new int[LEN + 1];
		int sum[] = new int[LEN + 1];
		Arrays.fill(cnt, 0);
		sum[0] = 0;
		for(int i = 0; i < n; i++) {
			cnt[sc.nextInt()]++;
		}
		for(int i = 1; i <= LEN; i++) {
			sum[i] = sum[i - 1] + cnt[i];
		}
		int ans = 0;
		for(int i = 0; i <= LEN; i++) {
			if(sum[LEN] - sum[i] == sum[i])ans++;
		}
		System.out.println(ans);
		
	}
	public static void main(String[] args) {
		new Main().doIt();
	}
}

/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