solve n = do
    let c k = genericLength $ filter (\x -> x^3 `mod` k == 1) [1..k-1]
    let (xs, ys) = partition ((==3) . c) primes
    a <- xs
    guard (a <= n)
    return a