var prime1, prime2 : boolean
var counter, number2 : int := 0
var numdiv : int
for number : 3 .. 399
    numdiv := number
    for count : 2 .. (number - 1) %Checking if the number is prime by making sure it has no factors other than 1 and itself
        if number / count mod 1 = 0 then
            prime1 := false
        else
            prime1 := true
        end if
    end for
    loop %Calculating the amount of digits in the number
        exit when numdiv <= 0
        numdiv := numdiv div 10
        counter := counter + 1
    end loop
    var digits : array 1 .. counter of int
    for count2 : 1 .. counter %Putting the digits into an array, one by one, each into its own slot
        digits (count2) := number div 10 ** (counter - 1)
    end for
    for decreasing count3 : counter .. 1
        number2 := number2 + digits (count3) * 10 ** (counter - 1) %Creating the backwards number
    end for
    if prime1 = true then
        for count4 : 2 .. (number2 - 1) %Checking if the backwards number is prime
            if number2 / count4 mod 1 = 0 then
                prime2 := false
            else
                prime2 := true
            end if
        end for
        if prime1 = true and prime2 = true then
            put number, " is a prime palindrome"
        end if
        counter := 0
    end if
end for