#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <random>
#include <iomanip>
#include <unordered_set>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int,int> > vpii;
typedef vector<pair<ll,ll> > vpll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vc> vvc;
typedef vector<vs> vvs;
typedef vector<vll> vvll;
typedef map<int,int> mii;
typedef set<int> si;
#define rep(i,n) for(ll i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define arep(i,v) for(auto i : v)
#define irep(it, stl) for(auto it = stl.begin(); it != stl.end(); it++)
#define drep(i,n) for(int i = (n) - 1; i >= 0; --i)
#define fin(ans) cout << (ans) << '\n'
#define STLL(s) strtoll(s.c_str(), NULL, 10)
#define mp(p,q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define fi first
#define se second
constexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
constexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;} return 0;}
template <class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;}
template <class T> inline void dump(T &v){irep(i, v){cout<<*i<<((i==--v.end())?'\n':' ');}}
inline string getline(){string s; getline(cin,s); return s;}
inline void yn(const bool b){b?fin("yes"):fin("no");}
inline void Yn(const bool b){b?fin("Yes"):fin("No");}
inline void YN(const bool b){b?fin("YES"):fin("NO");}
struct io{io(){ios::sync_with_stdio(false);cin.tie(0);}};
const int INF = INT_MAX;
constexpr ll LLINF = 1LL<<60;
constexpr ll MOD = 1000000007;
constexpr ld EPS = 1e-11;

template<class T>
void lambdaSort(vector<T> &v) {
    sort(all(v), [](auto const& l, auto const& r) {
        return l.se > r.se; // このbool式が成り立つ時入れ替える
    });
}

int main() {

    int n;
    cin>>n;
    vector<pair<ll,ll>> v(n);
    rep(i,n){
        ll a,b;
        cin>>a>>b;
        v[i]=mp(a,b);
    }
    double l,r;
    Sort(v);
    
    if(n%2==1){
        l=v[(n-1)/2].first;
        lambdaSort(v);
        r=v[n/2].second;
        cout<<ll(r-l+1)<<endl;
    } else {
        l=(v[(n-1)/2].first+(double)v[(n-1)/2+1].first)/2;
        lambdaSort(v);
        // for(int i=0;i<n;i++){
        //     cout<<v[i].se<<" ";
        // }
        // cout<<endl;
        // cout<<(n-1)/2<<endl;
        r=(v[(n-1)/2].se+(double)v[(n-1)/2+1].se)/2;
        // cout<<l<<" "<<r<<endl;
        cout<<ll((r-l+1)+(r-l))<<endl;
    }
}


// if(n%2==1)l=v[(n-1)/2].first;
//     else l=v[(n-1)/2+1].first;
//     lambdaSort(v);
//     r=v[n/2].second;
//     cout<<l<<" "<<r<<endl;

Measured memory_bytes: 6428