//Hanoi.java
//Author X.H.Sun, 2006.08.13
//用遞歸算法解Henoi塔問題:

import java.awt.*;

public class Hanoi{

  static void move(char getone, char putone){
    System.out.println(getone+"=>"+putone);
  }

  static void hanoi(int n, char one, char two, char three){
    if(n==1){
      move(one, three);
    }
    else{
      hanoi(n-1,one,three,two);
      move(one,three);
      hanoi(n-1,two,one,three); 
    }
  }

  public static void main(String args[]){
    hanoi(Integer.parseInt(args[0]),'A','B','C');
  }
}