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 static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int N = in.nextInt();
        int[] A = new int[N], B = new int[N];
        for (int i=0;i<N;i++) {
            A[i] = in.nextInt();
            B[i] = in.nextInt();
        }
        Arrays.sort(A);
        Arrays.sort(B);

        double low = N % 2 == 0 ? (A[N/2] + A[N/2-1]) / 2.0 : A[N/2];
        double high = N % 2 == 0 ? (B[N/2] + B[N/2-1]) / 2.0 : B[N/2];

        int cnt = N % 2 == 0 ? (int) ((high - low) * 2) + 1 : (int) (high - low) + 1;
        System.out.println(cnt);
    }
}
