Sort the program a bit

adder.tm

@@ -61,24 +61,6 @@
 
 # If we get this far we have overflow and should end the program
 39:1,0,510,0,0,0
-527:0,0,0,1,0,0
-526:0,0,527,1,0,527
-525:0,0,526,1,0,526
-524:0,0,525,1,0,525
-523:0,0,524,1,0,524
-522:0,0,523,1,0,523
-521:0,0,522,1,0,522
-520:0,0,521,1,0,521
-501:0,0,520,0,0,520
-502:0,0,501,1,0,501
-503:0,0,502,1,0,502
-504:0,0,503,1,0,503
-505:0,0,504,1,0,504
-506:0,0,505,1,0,505
-507:0,0,506,1,0,506
-508:0,0,507,1,0,507
-509:0,0,508,1,0,508
-510:0,0,509,1,0,509
 
 # Here we need to go back to reg pos 0 after the decrementer is done
 300:0,0,41,0,0,41
@@ -115,4 +97,22 @@
 # Here we jump back to the decrementer
 50:0,1,30,0,1,30
 
-
+# This is where we end the program, move back up the registry, to finally print bit 1-8 of the positive registry wich now holds the result
+527:0,0,0,1,0,0
+526:0,0,527,1,0,527
+525:0,0,526,1,0,526
+524:0,0,525,1,0,525
+523:0,0,524,1,0,524
+522:0,0,523,1,0,523
+521:0,0,522,1,0,522
+520:0,0,521,1,0,521
+501:0,0,520,0,0,520
+502:0,0,501,1,0,501
+503:0,0,502,1,0,502
+504:0,0,503,1,0,503
+505:0,0,504,1,0,504
+506:0,0,505,1,0,505
+507:0,0,506,1,0,506
+508:0,0,507,1,0,507
+509:0,0,508,1,0,508
+510:0,0,509,1,0,509