fastfunc isprim num .
   i = 2
   while i <= sqrt num
      if num mod i = 0
         return 0
      .
      i += 1
   .
   return 1
.
prev = 1
val = 1
while cnt < 9
   h = prev + val
   prev = val
   val = h
   if isprim val = 1
      write val & " "
      cnt += 1
   .
.
