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.*;
import java.io.*;
public class Main {

	public static void main(String[] args) throws Exception{
		int num = 998244353;

		// TODO Auto-generated method stub
 		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
 		PrintWriter out = new PrintWriter(System.out);
 		int n = Integer.parseInt(bf.readLine());
 		ArrayList<Integer> ai = new ArrayList<Integer>();
 		ArrayList<Integer> bi = new ArrayList<Integer>();
 		for(int i = 0;i<n;i++){
 			StringTokenizer st = new StringTokenizer(bf.readLine());
 			ai.add(Integer.parseInt(st.nextToken()));
 			bi.add(Integer.parseInt(st.nextToken()));
 		}
 		Collections.sort(ai);
		Collections.sort(bi);
 		if (n%2 == 1){
 			
 			out.println(bi.get(bi.size()/2)-ai.get(ai.size()/2)+1);
 			out.close();
 		}
 		else{
 			double b = (ai.get(ai.size()/2) + ai.get(ai.size()/2-1)+0.0)/2;
 			double c = (bi.get(bi.size()/2) + bi.get(bi.size()/2-1)+0.0)/2;
 			out.println((int)(2*(c-b)+1));
 			out.close();
 		}

	}

}
 	
 
//StringJoiner sj = new StringJoiner(" "); 
//sj.add(strings)
//sj.toString() gives string of those stuff w spaces or whatever that sequence is

 		
 		
 		
 		
	


