Armstrong

def findOrder(num):
    print(num)
    n = 0
    while num != 0:
        n = n + 1
        num = num // 10
        
    return n
    
def isArmstrong(num):
    o = findOrder(num)
    sum1 = 0
    temp = num
    
    while temp != 0:
        x = temp % 10
        sum1 = sum1 + pow(x, o)
        temp = temp // 10
        
    return (sum1 == num)
    
num = 153

print(isArmstrong(num))