F is_prime(a)
   I a == 2
      R 1B
   I a < 2 | a % 2 == 0
      R 0B
   L(i) (3 .. Int(sqrt(a))).step(2)
      I a % i == 0
         R 0B
   R 1B

F digit_sum(=n)
   V sum = 0
   L n > 0
      sum += n % 10
      n I/= 10
   R sum

V additive_primes = 0
L(i) 2..499
   I is_prime(i) & is_prime(digit_sum(i))
      additive_primes++
      print(i, end' ‘ ’)
print("\nFound "additive_primes‘ additive primes less than 500’)