Add PRIME1 solution.

Currently it works, but uses too much memory.
I think I'll have to stop using the sieve for
numbers above 10^(9/2) and just check every
number against every prime below and
immediately print those primes without storing
them.
Nope. That's way too slow.

Looks like bitarrays are REQUIRED.