#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline ll time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    vector<int> s(n),t(n);
    vector<pair<int,int>> v;
    for(int i=0;i<n;i++){
        cin >> s[i] >> t[i];
        v.push_back({s[i],(i+1)});
        v.push_back({t[i]+1,-(i+1)});
    }
    sort(v.begin(), v.end());
    int q; cin >> q;
    int idx = 0;
    int res = 0;
    set<int> st;
    while(q--){
        int h; cin >> h;
        while(idx < v.size() and v[idx].first <= h){
            int x = v[idx].second;
            if(x > 0){
                st.insert(x);
            }
            else{
                if(st.find(-x) != st.end()){
                    st.erase(-x);
                }
            }
            idx++;
        }
        res += st.size(); st.clear();
    }
    cout << res << endl;
}