anchor.diff:          ! This subroutine is borne out of convenience for the native print
           ! method is usually overkill when one wishes to print an integer
   
  -        subroutine printint(i)
  +        subroutine printint_64(i)
                   
                   integer (int64), intent(in) :: i
                   write (*, '(I0)') i;
   
  -        end subroutine printint
  -
  +        end subroutine printint_64
  +
  +        subroutine printint_32(i)
  +                
  +                integer (int32), intent(in) :: i
  +                write (*, '(I0)') i;
  +
  +        end subroutine printint_32
   
           ! Reverses a 64-bit integer
   
  
positive.code: 
          ! Brute force approach to distinguishing primes
  
          pure function isprime (s)
  
                  integer (int64), intent(in) :: s
                  integer (int64) :: i, top
                  logical :: isprime
  
                  isprime = .NOT. (s < 2 .OR. mod(s, 2) == 0);
  
                  top = int(sqrt(real(s)));
                  i = 3;
  
                  do while(isprime .AND. i <= top)
                          isprime = (mod(s, i) /= 0);
                          i = i + 2;
                  end do
  
                  isprime = (isprime .OR. s == 2);
  
                  return
  
          end function isprime
  
  
          ! Uses Euler's method for calculating the greatest common divisor
  
negative.code: 
          ! Immeadiate addition
          interface inc
                  module procedure inc_32, inc_64, inc_128
          end interface inc
  
          ! Immeadiate division
  