// A C++ program to solve the Tower of Hanoi problem
 
#include <iostream>
using namespace std;
 
void moveTower(int n, char from_rod, char to_rod, char aux_rod) {
    if (n == 1) {
        cout << "Move disk 1 from rod " << from_rod << " to rod " << to_rod << endl;
        return;
    }
    moveTower(n - 1, from_rod, aux_rod, to_rod);
    cout << "Move disk " << n << " from rod " << from_rod << " to rod " << to_rod << endl;
    moveTower(n - 1, aux_rod, to_rod, from_rod);
}
 
int main() {
    int n = 4; // Number of disks
    moveTower(n, 'A', 'C', 'B'); // A, B, and C are names of the rods
    return 0;
}
 

Ly8gQSBDKysgcHJvZ3JhbSB0byBzb2x2ZSB0aGUgVG93ZXIgb2YgSGFub2kgcHJvYmxlbQoKI2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKdm9pZCBtb3ZlVG93ZXIoaW50IG4sIGNoYXIgZnJvbV9yb2QsIGNoYXIgdG9fcm9kLCBjaGFyIGF1eF9yb2QpIHsKICAgIGlmIChuID09IDEpIHsKICAgICAgICBjb3V0IDw8ICJNb3ZlIGRpc2sgMSBmcm9tIHJvZCAiIDw8IGZyb21fcm9kIDw8ICIgdG8gcm9kICIgPDwgdG9fcm9kIDw8IGVuZGw7CiAgICAgICAgcmV0dXJuOwogICAgfQogICAgbW92ZVRvd2VyKG4gLSAxLCBmcm9tX3JvZCwgYXV4X3JvZCwgdG9fcm9kKTsKICAgIGNvdXQgPDwgIk1vdmUgZGlzayAiIDw8IG4gPDwgIiBmcm9tIHJvZCAiIDw8IGZyb21fcm9kIDw8ICIgdG8gcm9kICIgPDwgdG9fcm9kIDw8IGVuZGw7CiAgICBtb3ZlVG93ZXIobiAtIDEsIGF1eF9yb2QsIHRvX3JvZCwgZnJvbV9yb2QpOwp9CgppbnQgbWFpbigpIHsKICAgIGludCBuID0gNDsgLy8gTnVtYmVyIG9mIGRpc2tzCiAgICBtb3ZlVG93ZXIobiwgJ0EnLCAnQycsICdCJyk7IC8vIEEsIEIsIGFuZCBDIGFyZSBuYW1lcyBvZiB0aGUgcm9kcwogICAgcmV0dXJuIDA7Cn0K