#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)
 

I2luY2x1ZGUgPGlvc3RyZWFtPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewoJaW50IG47CgljaW4+Pm47CgkKCS8vaW5wdXQgYW4gYXJyYXkKCS8vVEMgLS0gTyhOKQoJaW50IGFycltuXTsKCWZvcihpbnQgaSA9IDAgOyBpPCBuIDsgaSsrKXsKCQljaW4+PiBhcnJbaV07Cgl9CgkvL2lucHV0IHF1ZXJ5CglpbnQgcTsKCWNpbj4+cTsKCS8vZm9yIGVhY2ggaW5wdXQgcXVlcnkgdHJhdmVyc2UgaW4gdGhlIGFycmF5IGFuZCBjb3VudCB0aGUgbnVtYmVyIG9mIHRpbWVzIGFuIGVsZW1lbnQgYXBwZWFycwoJLy9UQyAtLSBPKHEpCglmb3IoaW50IGkgPSAwIDsgaTwgcTsgaSsrKXsKCQlpbnQgcXVlcnk7CgkJY2luPj5xdWVyeTsKCQkKCQlpbnQgY250ID0gMDsKCQkvL1RDLS1PKE4pCgkJZm9yKGludCBqID0gMCA7IGo8IG4gOyBqKyspewoJCQlpZihhcnJbal09PSBxdWVyeSl7CgkJCQljbnQrKzsKCQkJfQoJCX0KCQljb3V0PDxjbnQ8PCIgIjsKCX0KCQoJcmV0dXJuIDA7Cn0KLy8gdG90YWwgdGltZSBjb21wbGV4aXR5ID0gIE8oTiArIE4qUSkgPSBPKE4qKDErUSkpID09PT0gTyhOKlEpCg==

MTAKMSAyIDIgMyAzIDQgNSA2IDcgNyAKMwoxIDIgMw==

10
1 2 2 3 3 4 5 6 7 7 
3
1 2 3