Quick python program to calculate the greatest common divisor of two numbers using the euclidian algorithm and print out steps

euclidian.py

import math

print("We will compute gcd(a,b)")
firstA = int(input("Enter A: "))
firstB = int(input("Enter B: "))
A = firstA
B = firstB
lastR = 1
R = 1

while R != 0:
    lastR = R
    Q = math.trunc(A/B)
    R = A - B*Q
    print(str(A)+"="+str(B)+"*"+str(Q)+"+"+str(R))
    A = B
    B = R

print("gcd("+str(firstA)+","+str(firstB)+") = "+str(lastR))