This is a factoring program I made that outputs all of the factor pairs of a number. I've been trying to make it as small as possible, rather than optimizing for speed, but it is still very fast. Any ideas on further optimizations?

```
:Prompt A
:For (I,1,1+int(√(A))) //In this case, I know I am losing 3 bytes. This is the only case where I am factoring for speed, since leaving the parentheses here off will slow it down 20x.
:If not(fPart(A/I //Using remainder( is faster, (I think), but it's a byte more, and I don't care enough about the tiny speed loss.
:Then
:Disp I
:Pause A/I
:End
:End
```

I'm asking because I don't see any other optimizations. And to think that this used to be 120 bytes!