main =>
    PCount = 0,
    foreach (I in 2..499)
        if prime(I) && prime(sum_digits(I)) then
            PCount := PCount + 1,
            printf("%4d ", I)
        end
    end,
    printf("\n\n%d additive primes found.\n", PCount).

sum_digits(N) = S =>
    S = sum([ord(C)-ord('0') : C in to_string(N)]).