Tower of Hanoi

This program solves problem Tower of Hanoi by moving disks from one rod to another rod using the third rod as intermediary such that smaller disks is always on top of the bigger ones.

Enter the number of disks: