Generate a Python program that has the following intention:

The intention of the program is to calculate the greatest common divisor (GCD) of two numbers using the Euclidean algorithm. The Euclidean algorithm is an efficient method for finding the GCD of two numbers.

The function p1 takes two numbers a and b as input and returns the GCD of a and b. The function uses a recursive approach to calculate the GCD. If the second argument b is 0, the function returns the first argument a as the GCD. Otherwise, the function calls itself with b and a % b as arguments. The modulo operation a % b gives the remainder when a is divided by b. The GCD of the two numbers b and a % b is then calculated recursively. Once the GCD is calculated for the two numbers, the function returns it. Provide exactly two different responses that are separated with 6 asterisk symbols: ******.
user