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 C++14 (GCC 5.4.1) (judge verdict: Accepted)

//==============================================================================================================
//     Anything is possible as long as you keep working at it , and don't back it down.( Believe That )   
//==============================================================================================================
//"Everything in the universe is balanced. Every disappointment
//  you face in life will be balanced by something good for you!
//             Keep going, never give up."           
//==============================================================================================================
/*------U Have To DO It------*/
#include<bits/stdc++.h>
using namespace std;
#define fast() ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll  long long
#define f(i,a,b) for(int i=a; i<b; i++)
#define ff(i,a,b) for(int i=a;i>=b;--i)
#define pb push_back
#define MP make_pair
#define int long long int
#define vi vector<int>
#define M map<int,int >
#define F     first
#define S    second
#define lb lower_bound
#define ub upper_bound
#define mem(a,n)  memset(a, n, sizeof(a))
#define st(x) sort(x.begin(),x.end())
#define rst(x) sort(x.rbegin(),x.rend())
#define std(v) sort(v.begin(),v.begin(),greater<int>()); 
#define double   long long  double
const int N = 2e3+5;
bool visit[N];
vi v[N];
int a[N];
int val;
int root;
int cnt=0;
int q[N];
signed main()
{
fast();
int n;
cin>>n;
cout<<n*n*n;;

return 0;
 

}