Generate a Python program that has the following intention:

The intention of the program below is to implement the Euclidean algorithm for finding the Greatest Common Divisor (GCD) of two numbers, a and b. The Euclidean algorithm is an efficient method for finding the GCD of two numbers.

The p1 function takes two arguments, a and b, and returns the GCD of a and b. The function uses a recursive approach to find the GCD. If b is not equal to zero, the function calls itself with the remaining part of the division (a % b) and the non-zero value b. This process continues until b becomes zero, which means a and b are coprime (i.e., their GCD is 1). In the final step, the function returns a, which is the GCD of the two numbers.
 The response should be in all capital letters.
user