fastfunc isprim num .
   i = 2
   while i <= sqrt num
      if num mod i = 0
         return 0
      .
      i += 1
   .
   return 1
.
for n = 1 to 199
   p = pow n 3 + 2
   if isprim p = 1
      write p & " "
   .
.
