#include <bits/stdc++.h>
using namespace std;

// #define int long long // intで書いたけど心配なときにlong longに変換する
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;

/* short */
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#define X real()
#define Y imag()

/* REPmacro */
#define REPS(i, a, n) for (ll i = (a); i < (ll)(n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (ll i = (a); i >= (ll)(n); --i)
#define DEP(i, n) DEPS(i, n, 0)
#define EACH(i, n) for (auto&& i : n)

/* debug */
#define debug(x) cerr << x << " " << "(L:" << __LINE__ << ")" << '\n';

/* alias */
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using D = double;
using P = complex<D>;
using vs = vector<string>;
template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;

/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
const D EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};

/* func */
inline bool inside(int y, int x, int H, int W) {return y >= 0 && x >= 0 && y < H && x < W;}
inline int in() {int x; cin >> x; return x;}
inline ll IN() {ll x; cin >> x; return x;}
inline vs split(const string& t, char c) {vs v; stringstream s(t); string b; while(getline(s, b, c)) v.eb(b); return v;}
template <typename T> inline bool chmin(T& a, const T& b) {if (a > b) a = b; return a > b;}
template <typename T> inline bool chmax(T& a, const T& b) {if (a < b) a = b; return a < b;}
template <typename T, typename S> inline void print(const pair<T, S>& p) {cout << p.first << " " << p.second << endl;}
template <typename T> inline void print(const T& x) {cout << x << endl;}
template <typename T, typename S> inline void print(const vector<pair<T, S>>& v) {for (auto&& p : v) print(p);}
template <typename T> inline void print(const vector<T>& v, string s = " ") {REP(i, v.size()) cout << v[i] << (i != (ll)v.size() - 1 ? s : "\n");}
inline void yesno(bool ok, string yes = "Yes", string no = "No") {cout << (ok?yes:no) << endl;}


signed main() {
    //my-code
    int n; cin >> n;
    vector<pair<ll, ll>> v1(n), v2(n);
    vector<ll> A(n), B(n);
    ll a, b;
    REP(i, n) {
        cin >> a >> b;
        A[i] = a; B[i] = b;
        v1[i] = mp(a, b);
        v2[i] = mp(b, a);
    }
    sort(ALL(v1));
    sort(ALL(v2));
    if (n % 2 == 1) {
        ll lmin = v1[n/2].Fi;
        ll lmax = 0LL;
        ll lim = 1000000000LL;
        REP(i, n/2+1) {
            chmax(lmax, v1[i].Se);
        }
        REPS(i, n/2+1, n) {
            chmin(lim, v1[i].Se);
        }
        lmax = min(lmax, lim);
        ll rmax = v2[n/2].Fi;
        ll rmin = 1000000000LL;
        lim = 0LL;
        REPS(i, n/2, n) {
            chmin(rmin, v2[i].Se);
        }
        REP(i, n/2) {
            chmax(lim, v2[i].Se);
        }
        rmin = max(rmin, lim);
        ll ans = rmax - lmin + 1;
        print(ans);
    } else {  // n%2 == 0
        ll lmin1 = v1[n/2-1].Fi;
        ll rmax1 = v2[n/2].Fi;
        ll lmin2 = v1[n/2].Fi;
        ll rmax2 = v2[n/2-1].Fi;
        ll ans = (rmax1+rmax2) - (lmin1+lmin2) + 1;
        print(ans);
    }

    return 0;
}

// https://github.com/kurokoji/.cpp-Template/wiki テンプレートについて
// http://www.creativ.xyz/dump-cpp-652 dump()について
// https://gist.github.com/rigibun/7905920 色々

Measured memory_bytes: 12704