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


int main(){
	int n;
	cin>>n;
	vector<int> meti;
	vector<int> naklebi;
	for(int i=0; i<n; i++){
		int s, a;
		cin>>s>>a;
		if(s==1) {
			meti.push_back(a);
		}else{
			naklebi.push_back(a);
		}
	}
	sort(naklebi.begin(), naklebi.end());
	sort(meti.begin(), meti.end());
	int m;
	cin>>m;
	for(int i=0; i<m; i++){
		int curr;
		cin>>curr;
		int result = 0;
		int left = 0;
		int right = meti.size();
		while(right!=left) {
			if(meti[(left+right)/2]<=curr){
				left = (left+right)/2+1;
			}else{
				right = (left+right)/2;
			}
		}
		result += left;
		curr = (-1)*curr;
		left = 0;
		right = naklebi.size();
		while(right!=left) {
			if(naklebi[(left+right)/2]<=curr){
				left = (left+right)/2+1;
			}else{
				right = (left+right)/2;
			}
		}
		result += left;
		cout<<result<<endl;
	}
	return 0;
}