function semiprime$(n)
    a = 2
    c = 0
    while c < 3 and n > 1
        if n mod a = 0 then
            n = n / a
            c = c + 1
        else
            a = a + 1
        end if
    wend
    if c = 2 then semiprime$ = "True" else semiprime$ = "False"
end function

for i = 0 to 64
    print i; chr$(9); semiprime$(i)
next i