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();
	}
} import java.util.*; util.* java 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();
	}
} Main Scanner sc = new Scanner(System.in); sc new Scanner(System.in) final int MOD = 1000000007; MOD 1000000007 final int MAX = Integer.MAX_VALUE; MAX Integer.MAX_VALUE Integer Integer.MAX_VALUE final long LMAX = Long.MAX_VALUE; LMAX Long.MAX_VALUE Long Long.MAX_VALUE final int LEN = 100000; 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);
		
	} 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);
		
	} int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int cnt[] = new int[LEN + 1]; cnt new int[LEN + 1] LEN + 1 LEN 1 int sum[] = new int[LEN + 1]; sum new int[LEN + 1] LEN + 1 LEN 1 Arrays.fill(cnt, 0) Arrays.fill Arrays cnt 0 sum[0] = 0 sum[0] sum 0 0 for(int i = 0; i < n; i++) {
			cnt[sc.nextInt()]++;
		} int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
			cnt[sc.nextInt()]++;
		} {
			cnt[sc.nextInt()]++;
		} cnt[sc.nextInt()]++ cnt[sc.nextInt()] cnt sc.nextInt() sc.nextInt sc for(int i = 1; i <= LEN; i++) {
			sum[i] = sum[i - 1] + cnt[i];
		} int i = 1; int i = 1; i 1 i <= LEN i LEN i++ i++ i {
			sum[i] = sum[i - 1] + cnt[i];
		} {
			sum[i] = sum[i - 1] + cnt[i];
		} sum[i] = sum[i - 1] + cnt[i] sum[i] sum i sum[i - 1] + cnt[i] sum[i - 1] sum i - 1 i 1 cnt[i] cnt i int ans = 0; ans 0 for(int i = 0; i <= LEN; i++) {
			if(sum[LEN] - sum[i] == sum[i])ans++;
		} int i = 0; int i = 0; i 0 i <= LEN i LEN i++ i++ i {
			if(sum[LEN] - sum[i] == sum[i])ans++;
		} {
			if(sum[LEN] - sum[i] == sum[i])ans++;
		} if(sum[LEN] - sum[i] == sum[i])ans++; sum[LEN] - sum[i] == sum[i] sum[LEN] - sum[i] sum[LEN] sum LEN sum[i] sum i sum[i] sum i ans++ ans System.out.println(ans) System.out.println System.out System System.out ans public static void main(String[] args) {
		new Main().doIt();
	} main {
		new Main().doIt();
	} new Main().doIt() new Main().doIt new Main() String[] args args 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();
	}
} 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();
	}
} Main
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();
	}
}
