toh recursion (2)

#include<bits/stdc++.h>

using namespace std ;


void Hanoi(int n,int i,int j,int k){
    if(n==1){
        cout<<"Put Disk from "<<i<<" to "<<k<<endl;
        return ;
    }
    else{
        Hanoi(n-1,i,k,j);
        Hanoi(1,i,j,k);
        Hanoi(n-1,j,i,k);
    }
}


int main(void){
    int n;
    while(true){
        cout<<"Enter 0 for stop"<<endl;
        cout<<"Enter the number of disks : "<<endl;
        cin>>n;
        if(!n) break ;
        Hanoi(n,1,2,3);
    }
    return 0;
}