Using python or a terminal couldsomeone please help me with these questions.. Thanks!

Compose a program that accepts two integers x and y from the command-line, and finds and writes the greatest common divisor (god) of x and y using Euclid's algorithm, which is an iterative computation based on the following observation: if x > y, then if y divides x, the gcd of x and y is y; otherwise the gcd of x and y is the same as the gcd of x% y and y