Problem:
Score : 100 points

Problem Statement

Takahashi is going to set a 3-character password.

How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?

Constraints

1 \leq N \leq 9

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

Print the number of possible passwords.

Sample Input 1

2

Sample Output 1

8

There are eight possible passwords: 111, 112, 121, 122, 211, 212, 221, and 222.

Sample Input 2

1

Sample Output 2

1

There is only one possible password if you can only use one kind of character.

Solution in Java7 (OpenJDK 1.7.0) (judge verdict: Wrong Answer)

import java.util.Scanner;

public class Main{
 
 public static void main(String[] args){
     
     Scanner in=new Scanner(System.in);
     
     long n=in.nextInt();
     
     if(1<=n&&n<=9){
     if(n!=1){
         long k=2*n*n;
     System.out.println(k);
     }
     if(n==1){
         System.out.println("1");
     }
     
     }
 }
 
    
}