#include <bits/stdc++.h>
using namespace std;
 
int main() {
    int n, q;
    cin >> n;
    unordered_map<int, int> hash_map;
    int array[n];
    for (int i = 0; i < n; i++) {
        cin >> array[i];
        hash_map[array[i]] = hash_map[array[i]] + 1;
    }
 
    cin >> q;
 
    for (int i = 0; i < q; i++) {
        int query;
        cin >> query;
 
        int count = hash_map[query];
        cout << count << endl;
    }
 
    return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKaW50IG1haW4oKSB7CiAgICBpbnQgbiwgcTsKICAgIGNpbiA+PiBuOwogICAgdW5vcmRlcmVkX21hcDxpbnQsIGludD4gaGFzaF9tYXA7CiAgICBpbnQgYXJyYXlbbl07CiAgICBmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykgewogICAgICAgIGNpbiA+PiBhcnJheVtpXTsKICAgICAgICBoYXNoX21hcFthcnJheVtpXV0gPSBoYXNoX21hcFthcnJheVtpXV0gKyAxOwogICAgfQogCiAgICBjaW4gPj4gcTsKIAogICAgZm9yIChpbnQgaSA9IDA7IGkgPCBxOyBpKyspIHsKICAgICAgICBpbnQgcXVlcnk7CiAgICAgICAgY2luID4+IHF1ZXJ5OwogCiAgICAgICAgaW50IGNvdW50ID0gaGFzaF9tYXBbcXVlcnldOwogICAgICAgIGNvdXQgPDwgY291bnQgPDwgZW5kbDsKICAgIH0KIAogICAgcmV0dXJuIDA7Cn0=

NQo1IDMgMiA1IDEKMgo1CjM=

5
5 3 2 5 1
2
5
3