#include <iostream>

using namespace std;

int main() {
	int n;
	cin>>n;
	
	//input an array
	//TC -- O(N)
	int arr[n];
	for(int i = 0 ; i< n ; i++){
		cin>> arr[i];
	}
	//input query
	int q;
	cin>>q;
	//for each input query traverse in the array and count the number of times an element appears
	//TC -- O(q)
	for(int i = 0 ; i< q; i++){
		int query;
		cin>>query;
		
		int cnt = 0;
		//TC--O(N)
		for(int j = 0 ; j< n ; j++){
			if(arr[j]== query){
				cnt++;
			}
		}
		cout<<cnt<<" ";
	}
	
	return 0;
}
// total time complexity =  O(N + N*Q) = O(N*(1+Q)) ==== O(N*Q)