input: def solveTowerOfHanoi(num_disks, start_rod = 'A', end_rod = 'C', aux_rod = 'B'): 
      """ Solve the Tower of Hanoi game for a given number of disks.
      The game is solved by recursively moving the disks from the start rod to the end rod using an auxiliary rod.
      If there is only one disk, it is moved directly to the end rod. Otherwise, the problem is solved recursively.
      Example:
      >>> solveTowerOfHanoi(2)
      Move disk 1 from rod A to rod B
      Move disk 2 from rod A to rod C
      Move disk 1 from rod B to rod C
      """
      if num_disks == 1: 
          print("Move disk 1 from rod", start_rod, "to rod", end_rod) 
          return
      solveTowerOfHanoi(num_disks - 1, start_rod, aux_rod, end_rod) 
      print("Move disk", num_disks, "from rod", start_rod, "to rod", end_rod) 
      solveTowerOfHanoi(num_disks - 1, aux_rod, end_rod, start_rod) 
    
    
  # Driver code 
  num_disks = 4
  solveTowerOfHanoi(num_disks)
output:     if num_disks == 1: 
          print("Move disk 1 from rod", start_rod, "to rod", end_rod) 
          return
      solveTowerOfHanoi(num_disks - 1, start_rod, aux_rod, end_rod) 
      print("Move disk", num_disks, "from rod", start_rod, "to rod", end_rod) 
      solveTowerOfHanoi(num_disks - 1, aux_rod, end_rod, start_rod)