//2020年4月17日現在

#include<stdio.h>
#include<cmath>
#include<math.h>
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<complex>
#include<queue>
#include<set>
#include<utility>
#include<iomanip>
#include<limits>
#include<thread>
#include<map>
#include<stack>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_set>
#include<unordered_map>
#include<fstream>
#include<list>
#include<functional>
#include<bitset>
#include<tuple>
#include <cstdio>

using namespace std;

template <class... A>
void prints() { cout << "\n"; }
template <class... A>
void prints_rest() { cout << "\n"; }
template <class T, class... A>
void prints_rest(const T &first, const A &... rest) { cout << " " << first; prints_rest(rest...); }
template <class T, class... A>
void prints(const T &first, const A &... rest) { cout << first; prints_rest(rest...); }
template <class T, class... A>
void printd(const T &first, const A &... rest) { cout << fixed << setprecision(15) << first; prints_rest(rest...); }


namespace {
    // printElems(&a[0], &a[n]);　みたいな感じで使う。
    void printElems(const int* begin, const int* end)
    {
        for (const int* p = begin; p != end; ++p) {
            std::cout << *p << ' ';
        }
        std::cout << std::endl;
    }
}

#define rep(i,n) for(int i=0; i<n; i++)
#define rep1(i,n) for(int i=1; i<n+1; i++)
#define repr(i,n) for(int i=n-1; i>=0; i--)
#define repr1(i,n) for(int i=n; i>0; i--)
#define FOR(i,j,n) for(int i=j; i < n; i++)
#define souatari(i,j,n) rep1(i,n-1)rep(j,i)
#define souatari1(i,j,n) for(int i=2; i<n+1; i++)rep1(j,i-1)
#define mp make_pair
#define F first
#define S second
#define elif else if

typedef long long ll;
typedef vector<int>  vi;
typedef vector<vi>  vvi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef array<int,3> arr3;
typedef long double D;


const ll llinf =  numeric_limits<ll>::max();
const ll _llinf = numeric_limits<ll>::lowest();
const int inf = numeric_limits<int>::max();
const int _inf = numeric_limits<int>::lowest();
const double dinf = numeric_limits<double>::infinity();
const ll MOD = 1000000007;
const ll BIG = 1LL<<60;



int main(){
    ll n;
    cin >> n;
    priority_queue<
        pll,
        vector<pll>,
        greater<pll>
    > q;
    rep(i,n){
        ll atmp,btmp;
        cin >> atmp >> btmp;
        q.push(mp(atmp,1));
        q.push(mp(btmp,-1));
    }
    ll st = 0;
    ll ed = 0;
    ll stm = -1;
    ll stM = -1;
    ll edm = -1;
    ll edM = -1;
    ll medm,medM;

    if(n%2 == 1){
        medm = (n+1)/2;
        medM = (n+1)/2;
    }
    else{
        medm = n/2;
        medM = (n/2)+1;
    }


    while(!q.empty()){
        pll tmp = q.top();
        q.pop();
        if(tmp.S == 1) st++;
        if(tmp.S == -1) ed++;
        if(stm==-1 && st == medm) stm = tmp.F;
        if(stM == -1 && st == medM) stM = tmp.F;
        if(edm==-1 && ed == medm) edm = tmp.F;
        if(edM == -1 && ed == medM) edM = tmp.F;
        //prints(tmp.F,stm,stM,edm,edM);
    }
    if(n%2==0){prints(edM+edm-stm-stM+1);}
    else{prints(edm-stm+1);}


    return 0;
}




Measured memory_bytes: 11592