An AGLL challenge:

Suppose that two variables (v1 and v2) each store a number between 0 and 9999 (inclusive). All other variables are assumed initialized to zero. Write a sequence of AGLL commands for which the final value of v1 is the original value of (v1 + v2).

Also, don't use any compound conditionals (those using the "," or "|" characters), and use less than 42 lines of code.

Extra credit: if you *were* allowed to use compound conditionals, find the minimum number of lines of code required to complete this task, and prove it's the minimum.