#define CPP17
#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#ifdef CPP17
#include <variant>
#endif

// Yay!!
#define endl codeforces

// macros for iterator
#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)

// alias
using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;

// variadic min/max
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }

// variadic chmin/chmax
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }

// multi demension array
template <typename T, std::size_t Head, std::size_t... Tail> struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };
template <typename T, std::size_t Head> struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };
template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;

#ifdef CPP17
// fill container
template <typename T, typename F, typename... Args> 
void fill_seq(T &t, F f, Args... args) { if constexpr (std::is_invocable<F, Args...>::value) { t = f(args...); } else { for (ssize_t i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); } }
#endif

// make multi dimension vector
template <typename T> vec<T> make_v(ssize_t sz) { return vec<T>(sz); }
template <typename T, typename... Tail> auto make_v(ssize_t hs, Tail&&... ts) { auto v = std::move(make_v<T>(std::forward<Tail>(ts)...)); return vec<decltype(v)>(hs, v); }

// init
namespace init__ { 
struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; 
}


const ll inf = 5e15;

int main() {
    ll n;
    std::cin >> n;
    vec<ll> av(n), bv(n);
    for (ll i = 0; i < n; i++) std::cin >> av[i] >> bv[i];

    ll l0, l1, u0, u1;
    {
        ll ng = 0, ok = inf;
        while (1 < std::abs(ok - ng)) {
            ll mid = (ok + ng) / 2;
            ll cnt = 0;
            for (ll i = 0; i < n; i++) cnt += (av[i] <= mid);
            (n / 2 + n % 2 <= cnt ? ok : ng) = mid;
        }
        l0 = ok;
        ng = 0, ok = inf;
        while (1 < std::abs(ok - ng)) {
            ll mid = (ok + ng) / 2;
            ll cnt = 0;
            for (ll i = 0; i < n; i++) cnt += (bv[i] <= mid);
            (n / 2 <= cnt ? ok : ng) = mid;
        }
        l1 = ok;
    }
    {
        ll ng = inf, ok = 0;
        while (1 < std::abs(ok - ng)) {
            ll mid = (ok + ng) / 2;
            ll cnt = 0;
            for (ll i = 0; i < n; i++) cnt += (mid <= bv[i]);
            (n / 2 + n % 2  <= cnt ? ok : ng) = mid;
        }
        u1 = ok;
        ng = inf, ok = 0;
        while (1 < std::abs(ok - ng)) {
            ll mid = (ok + ng) / 2;
            ll cnt = 0;
            for (ll i = 0; i < n; i++) cnt += (mid <= av[i]);
            (n / 2 <= cnt ? ok : ng) = mid;
        }
        u0 = ok;
    }

    if (n & 1) {
        std::cout << u1 - l0 + 1 << "\n";
    } else {
        ll minv = l0 + u0, maxv = l1 + u1;
        std::cout << maxv - minv + 1 << "\n";
    }
    return 0;
}



Measured memory_bytes: 6372