For this Question: From wiki-
The Tower of Hanoi is a mathematical puzzle where we have 3 rods and N disks. The puzzle starts with all the disks in ascending order of size on the first row. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:

1. Only one disk can be moved at a time.
2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
3. No larger disk may be placed on top of a smaller disk.
-----x--x--x------

Let the rods have names A, B and C. Given N number of disks, numbered 1 to N from top to bottom, display all the moves required to move the disks from rod A to C in minimum number of steps.The only line of input contains an integer N denoting the number of disks

Constraints: 
1 ≤ N ≤ 16Print sequence of moving disks, where each move is shown in the following format-
{DiskNumber}:{FromRod}->{ToRod}
Each move in the sequence is separated by a new lineInput
2

Output
1:A->B
2:A->C
1:B->C, I have written this Solution Code: # Recursive Python function to solve the tower of hanoi

def TowerOfHanoi(n , source, destination, auxiliary):
	if n==1:
		#print ("1:",source,"->",destination)
		print("1:%s->%s"%(source,destination))
		return
	TowerOfHanoi(n-1, source, auxiliary, destination)
	#print (n,"%d:",source,"->",destination)
	print("%d:%s->%s"%(n,source,destination))
	TowerOfHanoi(n-1, auxiliary, destination, source)
		
# Driver code
n = int(input())
TowerOfHanoi(n,'A','C','B'), In this Programming Language: Python, Now tell me if this Code is compilable or not?