Task 0

def left_bin_search(x, a):
    if len(a) != 0:
        l, r = -1, len(a) - 1
        while r - l > 1:
            m = (l + r) // 2
            if x <= a[m]:
                r = m
            else:
                l = m
        if x == a[r]:
            return r

def right_bin_search(x, a):
    if len(a) != 0:
        l, r = 0, len(a)
        while r - l > 1:
            m = (l + r) // 2
            if x >= a[m]:
                l = m
            else:
                r = m
        if x == a[l]:
            return l

n = int(input())
colors = [int(i) for i in input().split()]
m = int(input())
requests = [int(i) for i in input().split()]
for i in requests:
    i_of_first = left_bin_search(i, colors)
    i_of_last = right_bin_search(i, colors)
    if i_of_first == None:
        print(0)
    else:
        print(i_of_last - i_of_first + 1)