// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 2e5 + 5;
const int MOD = 1e9 + 7;

int N;
Pii A[MAXN];

void input()
{
    read(N);
    for (int i = 1; i <= N; ++i) {
        read(A[i].x); read(A[i].y);
    }
}

void solve()
{
    static int hash[MAXN];

    for (int i = 1; i <= N; ++i) {
        hash[i] = A[i].y;
    }
    std::sort(hash + 1, hash + N + 1);

    static int premax[MAXN], sufmin[MAXN];

    std::sort(A + 1, A + N + 1);
    premax[1] = A[1].y;
    sufmin[N] = A[N].y;
    for (int i = 1; i < N; ++i) premax[i+1] = std::max(premax[i], A[i+1].y);
    for (int i = N; i > 1; --i) sufmin[i-1] = std::min(sufmin[i], A[i-1].y);

    vector<Pii> interval;

    for (int i = 1; i <= N; ++i) {
        int l = std::lower_bound(hash + 1, hash + N + 1, sufmin[i]) - hash;
        int r = std::lower_bound(hash + 1, hash + N + 1, premax[i]) - hash;
        interval.push_back(MP(l, r));
    }
    std::sort(ALL(interval));

    static int dp[MAXN];

    int p = 0, sum = 1;
    dp[0] = 1;
    for (int i = 1, j = 0; i <= N; ++i) {
        for (; j < SZ(interval) && interval[j].y == i; ++j) {
            for (; p + 1 < interval[j].x; ++p) {
                (sum += MOD - dp[p]) %= MOD;
            }
            dp[i] = (dp[i] * 2 % MOD + sum) % MOD;
        }
        (sum += dp[i]) %= MOD;
    }
    int ans = dp[N];

    printf("%d\n", ans);
}

int main()
{
#ifdef __DEBUG
    freopen("E.in", "r", stdin);
    freopen("E.out", "w", stdout);
#endif

    input();
    solve();

    return 0;
}

// 鸿雁来时，无限思量。
//     -- 晏殊《诉衷情·芙蓉金菊斗馨香》


Measured memory_bytes: 6644