def UCLN(a,b):
    while b != 0:
        r = a % b
        a = b
        b = r
    return a
def solved(n):

    check = []
    ans = 0
    for i in range(1,n+1):
        a = i / 2
        if a % 2 == 0:
            #print(i)
            check.append(2)
            check.append(i)
            ans += 1
    for i in range(1,n+1):
        for j in range(n,i+1,-1):
            uc = UCLN(i,j)
            if uc > 1 and i not in check and j not in check:
                ans += 1
                check.append(i)
                check.append(j)
    #print(*check,sep='\n')
    return ans
if __name__ == '__main__':
    case = int(input())
    arr = []
    for _ in range(case):
        t = int(input())
        arr.append(t)
    for i in arr:
        print(solved(i))