USING: io kernel math math.parser ;
IN: factorial-example
: modulo ( n -- n! )
dup
2
/
2
*
=
[ 1 ]
[ 0 ]
if ;
: bin ( n -- )
dup
0 =
[ drop ]
[ dup
mod
swap
-1
shift
bin
number>string print
]
if ;
!readln string>number
!bin
1
mod
VVNJTkc6IGlvIGtlcm5lbCBtYXRoIG1hdGgucGFyc2VyIDsKCklOOiBmYWN0b3JpYWwtZXhhbXBsZQoKOiBtb2R1bG8gKCBuIC0tIG4hICkKIGR1cAogMgogLwogMgogKgogPQogWyAxIF0KIFsgMCBdCiBpZiA7CiAKOiBiaW4gKCBuIC0tICApIAogZHVwCiAwID0KIFsgZHJvcCBdCiBbIGR1cCAKICBtb2QKICBzd2FwIAogIC0xCiAgc2hpZnQgCiAgYmluIAogIG51bWJlcj5zdHJpbmcgcHJpbnQgCiBdCiBpZiA7CiAKCiFyZWFkbG4gc3RyaW5nPm51bWJlcgohYmluCjEKbW9kCgo=