Haskell problem

Skip every other prime in a list.

Create a function named problem1. Use a list comprehension for the main function. This function will take a single integer parameter. It indicates the number of primes that will be the final list. The final solution will output a list of every other prime. problem1 10 --> [2,5,11,17,23,31,41,47,59,67] problem1 7 --> [2,5,11,17,23,31,41]

I have an isPrime function that figures out if the funciton is prime. This is the code I have but it messes up at 23-29 for some reason because I get [2,5,11,17,23,29,41,47,53,59] instead of [2,5,11,17,23,31,41,47,59,67] when entering problem1 10.

problem1 :: Int -> [Int]

problem1 n = take n [x | x <- [2,5..], isPrime x]