n=2^(55-peek(0)):for j=0to 1for i=n to 127step n?chr$(65+mod(or(i,i-1)*j+j+and(i,i-1)*!j,3));next:?next
Note that non-ascii characters in the above source code will be escaped (such as \x9f).
download
return to the top page