-- | Generates the sequence of prime numbers.
-- Based on <http://qiita.com/little_Haskeller/items/614a3ae20a517c19bb1f this article> .
primes2 :: Integral a => [a]
primes2 = map fromIntegral primes2'
    where
        primes2' = [2, 3, 5] ++ sieve2 5 7 (drop 2 primes2')
        sieve2 m s (p : ps) = [n | n <- ns, gcd m n == 1] ++ sieve2 (m * p) (p * p) ps
            where ns = [x + y | x <- [s, s + 6 .. p * p - 2], y <- [0, 4]]

countPairOfPrimes :: Integral a => a -> Int
countPairOfPrimes n = length $ filter id $ zipWith isPairOfPrimes [1 .. n] [n, n - 1 .. 1]
    where
        primes = takeWhile (<= n) primes2
        isPairOfPrimes x y = elem x primes && elem y primes

main :: IO ()
main = putStr . unlines . map show .
    map countPairOfPrimes . map read . lines =<< getContents