import Data.Maybe
import qualified Data.ByteString.Char8 as B
nearestMultipleOf :: Integral a => a -> a -> a
nearestMultipleOf n k = if mod n k == 0 then n else nearestMultipleOf (n-1) k
sumMultiplesOf :: Integral a => a -> a -> a
sumMultiplesOf n k = foldl (+) 0 [k,k*2..nearest]
where nearest = nearestMultipleOf n k
solution :: Integral a => a -> a
solution n = s03 + s05 - s15
where s03 = sumMultiplesOf (n-1) 3
s05 = sumMultiplesOf (n-1) 5
s15 = sumMultiplesOf (n-1) 15
main = do
c <- B.getContents
let ns = tail $ B.lines c
putStr $ unlines $ map show $ map (solution . fst . fromJust . B.readInt) ns