#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int N = 200010;

int a[N], b[N];

int main() {
	int n;
	scanf("%d", &n);
	for(int i=1; i<=n; i++)
		scanf("%d%d", &a[i], &b[i]);
	sort(a+1, a+n+1);
	sort(b+1, b+n+1);
	if(n&1)
		printf("%d\n", b[(n+1)/2]-a[(n+1)/2]+1);
	else {
		int mn = a[n/2+1]+a[n/2];
		int mx = b[n/2+1]+b[n/2];
		printf("%d\n", mx-mn+1);
	}
	return 0;
}