import java.util.ArrayList;
class Solution {
public ArrayList<int[]> answer = new ArrayList<int[]>();
public int[][] solution(int n) {
hanoi(n, 1, 3, 2);
int[][] answerArray = new int[answer.size()][2];
for (int i = 0; i < answer.size(); i++) {
answerArray[i] = answer.get(i);
}
return answerArray;
}
public void hanoi(int n, int from, int to, int via) {
if (n == 1) {
int[] move = {from, to};
answer.add(move);
return;
}
hanoi(n - 1, from, via, to);
int[] move = {from, to};
answer.add(move);
hanoi(n - 1, via, to, from);
}
}