import Control.Applicative ((<$>))
import Control.Monad (replicateM)

import Data.ByteString.Char8 (ByteString)
import qualified Data.ByteString.Char8 as B

main :: IO ()
main = do
  n <- getl $ readi B.readInt
  solve <$> replicateM n (getl $ readi B.readInt) >>= mapM_ print

solve :: [Int] -> [Int]
solve = map tnacci

tnacci :: Int -> Int
tnacci x | x == 1 = 0
         | x == 2 = 0
         | x == 3 = 0
         | otherwise = f x 0 0 0 1
  where
    f n a b c d | n == 4 = d
                | otherwise = f (n - 1) b c d $ (a + b + c + d) `mod` 17

getl :: (ByteString -> a) -> IO a
getl f = f <$> B.getLine

readi :: Integral a =>  (ByteString -> Maybe (a, ByteString)) -> ByteString -> a
readi f s = let Just (n, _) = f s in n