Greatest Common Divisor

def gcd(num, den):
    a = num
    b = den
    if a < b:
        while den != 0:
            (num, den) = (den, num%den)
        print('GCD is: ',num)
        num1 = a/num
        den1 = b/num
        print('Reduced value is: %d/%d' % (num1, den1))
    if a > b:
        while den != 0:
            (num, den) = (den, num%den)
        print('GCD is: ',num)
        num1 = a/num
        den1 = b/num
        if num1%den1 > 0:
            print('Reduced value is: %d/%d' % (num1, den1))
            print('Whole number value is: ',num1/den1,'and',num1%den1,'/',den1)
        if num1%den1 == 0:
            print('Reduced value is: %d/%d' % (num1, den1))
            print('Whole number value is: ',num1/den1)

num=int(input('Input numerator: '))
den=int(input('Input denominator: '))
gcd(num, den)