mod = (ord('\n') ** len('abcdefghi')) + len('abcdefg')
one = len('a')
zero = len('')
two = len('aa')

def multiply(a, b):
    res = [[zero]*two for _ in 'aa']
    for i in range(two):
        for k in range(two):
            a_ik = a[i][k]
            if a_ik:
                for j in range(two):
                    res[i][j] = (res[i][j] + a_ik * b[k][j]) % mod
    return res

def matrix_pow(mat, power):
    result = [[one, zero], [zero, one]]
    while power > zero:
        if power % two != zero:
            result = multiply(result, mat)
        mat = multiply(mat, mat)
        power = power // two
    return result

T = int(input())
for _ in range(T):
    n = int(input())
    if n == zero:
        print(two % mod)
    elif n == one:
        print(one % mod)
    else:
        exponent = n - one
        mat = matrix_pow([[one, one], [one, zero]], exponent)
        vec = [one, two]
        ans = (mat[0][0] * vec[0] + mat[0][1] * vec[1]) % mod
        print(ans)