def mul(a, b):
    c = [[0]*len(b[0]) for i in range(len(a))]
    for i in range(len(a)):
        for k in range(len(b)):
            for j in range(len(b[0])):
                c[i][j] = (c[i][j]+a[i][k]*b[k][j]) % 17
    return c

def pow(a, n):
    #単位行列
    b = [[0] * len(a) for i in range(len(a))]
    for i in range(len(a)):
        b[i][i] = 1

    while n > 0:
        if n & 1 == 1:
            b = mul(a, b)
        a = mul(a, a)
        n = n >> 1

    return b


def main():
    q = int(input())
    a = [[1, 1, 1, 1], [1, 0, 0, 0], [0, 1, 0, 0], [0, 0, 1, 0]]

    for i in range(q):
        n = int(input())
        an = pow(a, n)
        print(an[3][3])


if __name__ == '__main__':
    main()