Towers of Hanoi in Python (using recursion)

Hanoi.py

def Hanoi(ndisks, start_rod=1, end_rod=3):
    if ndisks:
        Hanoi(ndisks - 1, start_rod, 6 - start_rod - end_rod)
        print('Move disk {DISK} from {START} to {END}'.format(DISK = ndisks, START = start_rod, END = end_rod))
        Hanoi(ndisks - 1, 6 - start_rod - end_rod, end_rod)

if __name__ == '__main__':
    print('Towers Of Hanoi - Recursion!')
    disks = input('Enter number of disks >>>')
    Hanoi(int(disks))
    print('Thanks for playing!')