input: Write a python function to solve the Towers of Hanoi problem.
  assert TowersOfHanoi(2, 'A', 'C', 'B') == None # Output: Move disk 1 from rod A to rod B \n Move disk 2 from rod A to rod C \n Move disk 1 from rod B to rod C
  assert TowersOfHanoi(3, 'A', 'C', 'B') == None # Output: Move disk 1 from rod A to rod C \n Move disk 2 from rod A to rod B \n Move disk 1 from rod C to rod B \n Move disk 3 from rod A to rod C \n Move disk 1 from rod B to rod A \n Move disk 2 from rod B to rod C \n Move disk 1 from rod A to rod C
  assert TowersOfHanoi(1, 'A', 'C', 'B') == None # Output: Move disk 1 from rod A to rod C
output: def TowersOfHanoi(n, source, destination, auxiliary):
      if n == 1:
          print(f"Move disk 1 from rod {source} to rod {destination}")
          return
      TowersOfHanoi(n - 1, source, auxiliary, destination)
      print(f"Move disk {n} from rod {source} to rod {destination}")
      TowersOfHanoi(n - 1, auxiliary, destination, source)