from collections import deque


class Modint:

    MOD = 17

    def __init__(self, value: int) -> None:
        self.num = value % Modint.MOD

    def __str__(self) -> str:
        return str(self.num)

    __repr__ = __str__

    def __add__(self, __x):
        if isinstance(__x, Modint):
            return Modint((self.num + __x.num))
        return Modint(self.num + __x)

    def __sub__(self, __x):
        if isinstance(__x, Modint):
            return Modint(self.num - __x.num)
        return Modint(self.num - __x)

    def __mul__(self, __x):
        if isinstance(__x, Modint):
            return Modint(self.num * __x.num)
        return Modint(self.num * __x)

    __radd__ = __add__
    __rmul__ = __mul__

    def __rsub__(self, __x):
        if isinstance(__x, Modint):
            return Modint(__x.num - self.num)
        return Modint(__x - self.num)

    def __pow__(self, __x):
        if isinstance(__x, Modint):
            return Modint(pow(self.num, __x.num, Modint.MOD))
        return Modint(pow(self.num, __x, Modint.MOD))

    def __rpow__(self, __x):
        if isinstance(__x, Modint):
            return Modint(pow(__x.num, self.num, Modint.MOD))
        return Modint(pow(__x, self.num, Modint.MOD))


class Tetranacci:
    def __init__(self):
        self._array = {1: Modint(0), 2: Modint(0), 3: Modint(0), 4: Modint(1)}
        self.max_idx = 4

    def calc(self, idx: int) -> int:
        if idx <= self.max_idx:
            return self._array[idx]

        for _idx in range(self.max_idx+1, idx+1):
            self._array[_idx] = (
                self._array[_idx-4] + self._array[_idx-3]
                + self._array[_idx-2] + self._array[_idx-1]
            )
        self.max_idx = max(self.max_idx, idx)
        return self._array[idx]

    def loop(self) -> int:
        self.newest = deque(self._array.values(), maxlen=4)
        self.initial = deque(self._array.values(), maxlen=4)
        for _idx in range(self.max_idx+1, 999):
            self._array[_idx] = (
                self._array[_idx-4] + self._array[_idx-3]
                + self._array[_idx-2] + self._array[_idx-1]
            )
            self.newest.append(self._array[_idx])
            if self.newest == self.initial:
                return _idx


def main():
    Q = int(input())
    array = Tetranacci()
    array.loop()
    for _ in range(Q):
        print(array.calc(int(input())))


if __name__ == "__main__":
    main()