Write a program to find the greatest common divisor (GCD) of two 16-bit numbers stored at $1000~$1001 and $1002~$1003, and store the result at $1010~1011. Enter the two test numbers manually at the beginning of your code. The most efficient method for finding the greatest common divisor is the Euclidean method.