PROGRAMMING:The problem of Hanoi Tower

There is a Vatican Pagoda in an ancient temple. There are three seats a, B and C in the pagoda. On seat a, there are 64 plates of different sizes, of which the large one is at the bottom and the small one is at the top. There is a monk who wants to move these 64 disks from seat a to seat B, but only one disk can be moved at a time. The disk moved can only be placed on the other two seats, and the large disk can not be pressed on the small disk. Now we need to use the program to simulate the process, input a positive integer n, representing the number of dishes, write the function
```
void hanoi(int n,char a,char b,char c)
```
Where, n is the number of plates, from a to B, and C is the intermediate transition. The function outputs the path to move plates.
###Input format:
The input gives a positive integer n in one line.
###Output format:
Output path of moving plate.
###Input example:
```in
three
```
###Output example:
```out
a-->b
a-->c
b-->c
a-->b
c-->a
c-->b
a-->b
```







answer：If there is no answer, please comment