Euler21 Finis

A little direct but it works. If I made a pass to filter for primes
first and then more intelligently did it it’d run faster.
Unfortunately, I’m not sure how to do Sieve of Eratosthenes in Haskell…
It runs in about 5 seconds.