def main():
    while True:
        num = int(input("Enter a number: "))
        print("""
        1. Sum of digits of Number
        2. Reverse a number
        3. Palindrome number
        4. Armstrong number
        5. Perfect Number
        6. Prime number
        7. Check if digit is in number
        8. Exit
        """)
        choice = int(input("Choice: "))
        if choice <=8:
            if choice == 1:
                result = sumofdigit(num)
            elif choice == 2:
                result = revnum(num)
                print(f"Reversed number is  ",end='')
            elif choice == 3:
                result = palindrome(num)
            elif choice == 4:
                result = armstrong(num)
            elif choice == 5:
                result = perfect(num)
            elif choice == 6:
                result = prime(num)
            elif choice == 7:
                digit = int(input("Enter a digit: "))
                result = checkdigit(digit, num)
            elif choice == 8:
                print("Ending program.....")
                break
            print(result)
        else:
            print("Invalid Choice")
def sumofdigit(num):
    sum = 0
    while num > 0:
        digit = num % 10
        sum += digit
        num //= 10
    return f"The sum of digits is {sum}"

def revnum(num):
    Rev = 0
    m = num
    while num > 0:
        digit = num % 10
        Rev = Rev * 10 + digit
        num = num // 10
    return Rev

def palindrome(num):
    Rev = revnum(num)
    if Rev == num:
        return f"{num} is a palindrome"
    else:
        return f"{num} is not a palindrome"
def armstrong(num):
    original_num = num
    sum = 0
    while num > 0:
        digit = num % 10
        sum += digit ** 3
        num //= 10
    if sum == original_num:
        return f"{original_num} is an Armstrong number"
    else:
        return f"{original_num} is not an Armstrong number"
def perfect(num):
    sum = 0
    for i in range(1, num):
        if num % i == 0:
            sum += i
    if sum == num:
        return f"{num} is a perfect number"
    else:
        return f"{num} is not a perfect number"
def prime(num):
    if num <= 1:
        return f"{num} is not prime"
    for i in range(2, num):
        if num % i == 0:
            return f"{num} is not prime"
    return f"{num} is prime"
def checkdigit(digit, num):
    while num > 0:
        dig = num % 10
        if dig == digit:
            return f"{digit} is in the number {num}"
        num //= 10

    return f"{digit} is not in the number"
main()