def bincounter_1(mas, a):
    left = -1
    right = len(mas)
    while right - left > 1:
        middle = (right + left) // 2
        if mas[middle] >= a:
            right = middle
        else:
            left = middle
    return left

def bincounter_2(mas, a):
    left = -1
    right = len(mas)
    while right - left > 1:
        middle = (right + left) // 2
        if mas[middle] > a:
            right = middle
        else:
            left = middle
    return right

n = input()
if (int)(n) > 0:
    s=list(map(int,input().strip().split(' ')))
m = input()
if (int)(n) == 0:
    for i in range (0, (int)(m)):
        print(0)
if (int)(n) > 0:
    s_2=list(map(int,input().strip().split(' ')))
    for i in range(0,len(s_2)):
        print(bincounter_2(s,s_2[i]) - bincounter_1(s,s_2[i]) - 1)