Collatz Conjecture for Java

collatz

/*
 * Rithms
 * collatz.java
 * 
 * Collatz Conjecture - Start with a number n > 1.
 * Find the number of steps it takes to reach one 
 * using the following process: If n is even, divide 
 * it by 2. If n is odd, multiply it by 3 and add 1.
 */

import java.util.Scanner;

public class collatz {

        /**
         * @param args
         */
        public static void main(String[] args) {
                
                int steps = 0;
                
                System.out.println("Enter a number:");
                Scanner scan = new Scanner(System.in);
                
                int n = scan.nextInt();
                int x = n;
                
                while(n > 1){
                        if(n % 2 == 0)
                                n /= 2;
                        else n = (n * 3) + 1;
                        steps++;        
                }
                
                System.out.println("It takes \'" + steps + "\' steps to reach \'1\' using the Collatz conjecture on the number \'" + x +"\'.");

        }

}