Print every multiplication of recursion

[pyghorz]

The solution to the problem is:

def expo(a,n):
    if n == 0:
        return 1
    elif n%2 == 0:
        return expo(a*a, n/2)
    elif n%2 == 1:
        return a*expo(a*a, (n-1)/2)

a = int(input("Enter a: "))
n = int(input("Enter n: "))

print(expo(a,n))

A test output is:

Enter a: 4
Enter n: 4
256

---

def expo(a,n):
    if n == 0:
        return 1
    elif n%2 == 0:
        return expo(a*a, n/2)
    elif n%2 == 1:
        return a*expo(a*a, (n-1)/2)

a = int(input("Enter a: "))
n = int(input("Enter n: "))

print(expo(a,n))