Read in an integer n from the user. You may assume that it is at least 2.
Call a separate function to determine if the number n is prime. You must use call and jumpr instructions to call and return from this separate function. The function should use a loop to determine if n is prime, and it should return the appropriate value: If n is not prime, the function should return the smallest value between 2 and n // 2 that divides into n evenly.
If n is prime, the function should return the number n itself. After the function call has returned, the program should print two values:
the return value of the function
one of two integers:
if n is prime, it should print a 1 (for True)
if n is not prime, it should print a 0 (for False)