There are N integers X_1, X_2, \cdots, X_N, and we know that A_i \leq X_i \leq B_i. Find the number of different values that the median of X_1, X_2, \cdots, X_N can take.

Constraints

* 2 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq B_i \leq 10^9
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N
A_1 B_1
A_2 B_2
:
A_N B_N


Output

Print the answer.

Examples

Input

2
1 2
2 3


Output

3


Input

3
100 100
10 10000
1 1000000000


Output

9991
import java.util.Arrays;
import java.util.Scanner;

public class Main {

    public Main() {
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();

        long[] A = new long[N], B = new long[N];
        for (int i = 0; i < N; i++) {
            A[i] = scanner.nextLong();
            B[i] = scanner.nextLong();
        }

        Arrays.sort(A);
        Arrays.sort(B);

        long medianA, medianB;
        if(N % 2 == 0){
            medianA = A[N/2-1] + A[N/2];
            medianB = B[N/2-1] + B[N/2];
        } else {
            medianA = A[(N+1)/2-1];
            medianB = B[(N+1)/2-1];
        }

        System.out.println(medianB-medianA+1);
    }

    public static void main(String[] args) {
        new Main();
    }
}
