fastfunc isprim n .
   if n < 2 : return 0
   i = 2
   while i <= sqrt n
      if n mod i = 0 : return 0
      i += 1
   .
   return 1
.
for i = 2 to 999
   if isprim i = 1
      ind += 1
      sum += i
      if isprim sum = 1
         print ind & " " & i & " " & sum
      .
   .
.