#include <bits/stdc++.h>

using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
//#define mp make_pair
#define pb push_back
#define vi vector<int>
#define pqi priority_queue<ll>
#define ti tuple<ll,ll,ll,ll>
#define dqi deque<int>
#define si set<int>
#define ff first
#define ss second
#define rep(i,a,b) for(ll i=(a); i<(b); i++)
#define repd(i,a,b) for(ll i=(a)-1; i!=(b)-1; i--)
#define all(x) x.begin(),x.end()
#define nl '\n'
#define cma <<','<<
ll mod = 998244353;
ll inf = 1e18;
const ll maxn = 1e6+5;


int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);

	ll n; cin >> n;
	vector<pll> v;
	rep(i,0,n){
		ll a,b; cin >> a >> b;
		v.pb({a,b});
	}
	sort(all(v));
	ll k; cin >> k;
	int cur = 0, ans = 0;
	
	while(k--){
		ll x; cin >> x;
		while(cur < n && v[cur].ff <= x){
			if(v[cur].ss >= x) ans++;
			cur++;
		}
		
	}

	
	cout << ans;
	
	
}
/*
4
1 5
2 3
3 8
5 5
1
5

*/