Towers Of Hanoi Program

//Program to demonstrate Towers Of Hanoi 
import java.util.Scanner;
class tb
{ 
// Java recursive function to solve tower of BRAHMA/HANOI puzzle 
 static int c=0;   
 static void th(int n, char ST, char DT, char TT) 
    { 
        if (n == 1) 
        { 
            System.out.println("Move disk 1 from PEG " +  ST + " to PEG " + DT); 
            c++;
            return; 
        } 
        th(n-1, ST, TT, DT); 
        System.out.println("Move disk " + n + " from PEG " +  ST + " to PEG " + DT); 
        c++;
        th(n-1, TT, DT, ST);
         
    }
    public static void main(String args[]) 
    { 
        Scanner s=new Scanner(System.in);
        System.out.println("Enter Number Of Disks To Move:");
        int n = s.nextInt(); // Number of disks 
        th(n, 'A', 'C', 'B');  // A, B and C are names of PEG/TOWERS
        System.out.println("\nTotal Number Of Moves Occurred: "+c); 
    }
}

Output:
E:\>java tb
Enter Number Of Disks To Move:
1
Move disk 1 from PEG A to PEG C

Total Number Of Moves Occurred: 1

E:\>java tb
Enter Number Of Disks To Move:
2
Move disk 1 from PEG A to PEG B
Move disk 2 from PEG A to PEG C
Move disk 1 from PEG B to PEG C

Total Number Of Moves Occurred: 3

E:\>java tb
Enter Number Of Disks To Move:
3
Move disk 1 from PEG A to PEG C
Move disk 2 from PEG A to PEG B
Move disk 1 from PEG C to PEG B
Move disk 3 from PEG A to PEG C
Move disk 1 from PEG B to PEG A
Move disk 2 from PEG B to PEG C
Move disk 1 from PEG A to PEG C

Total Number Of Moves Occurred: 7