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

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    
    auto solve = [&]() {
        int n;
        cin >> n;

        vector<int> l(n), r(n);
        for (int i = 0; i < n; i++) {
            cin >> l[i] >> r[i];
            l[i]--, r[i]--;
        }

        int q;
        cin >> q;

        vector<int> x(q);
        for (int i = 0; i < q; i++) {
            cin >> x[i];
            x[i]--;
        }

        if (x[0] == 0) {
            int ans = 0;
            vector<int> pref(r);
            for (int i = 1; i < n; i++) {
                pref[i] = max(pref[i - 1], pref[i]);
            }
            int R = 0;
            while (R != n - 1) {
                ans++;
                R = pref[R];
            }
            cout << ans << '\n';
            return;
        }

        vector dis(n, vector<int>(n, -1));
        vector<pair<int, int>> que{pair(x[0], x[0])};
        dis[x[0]][x[0]] = 0;

        for (int b = 0; b < int(que.size()); b++) {
            auto [x, y] = que[b];
            for (int i = x; i <= y; i++) {
                int nx = min(x, l[i]);
                int ny = max(y, r[i]);
                if (dis[nx][ny] == -1) {
                    dis[nx][ny] = dis[x][y] + 1;
                    que.emplace_back(nx, ny);
                }
            }
        }

        cout << dis[0][n - 1] << '\n';
    };

    solve();

    return 0;
}