The input contains a single integer *a* (1 ≤ *a* ≤ 30).

Output a single integer.
The input contains a single integer *a* (1 ≤ *a* ≤ 30).
none
3
27
1
4
2
22
4
58
5
85
6
94
7
121
8
166
9
202
10
265
11
274
12
319
13
346
14
355
15
378
16
382
17
391
18
438
19
454
20
483
21
517
22
526
23
535
24
562
25
576
26
588
27
627
28
634
29
636
30
645
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define PI 3.14159265;
#define f for(int i=0;i<n;i++)
#define ff for(int i=0;i<n;i++){for(int j=0;j<m;j++){cin>>arr[i][j];if(arr[i][j]=='C' ||arr[i][j]=='M' ||arr[i][j]=='Y')c=0;}}
#define beshoo ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
string vowel = ("AEIOUYaeiouy");
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const ll mod = 1000000007;
bool isprime(long long n);
long long fibonacci(long long x);
long long factorial(long long x);
long long permutations(long long x,long long y);
long double combinations(long double x,long double y);
int main()
{
    beshoo
    int n;cin>>n;
    cout<<pow(n,3);
    return 0;
}

// our functions

long long factorial(long long x)
{
    long long fact=1;for(long long i=1;i<=x;i++){fact*=i;}
    return fact;
}

long long permutations(long long x,long long y)
{
    long long fact1=1;for(long long i=1;i<=max(x,y);i++){fact1*=i;}
    long long fact2=1;for(long long i=1;i<=abs(x-y);i++){fact2*=i;}
    return fact1/fact2;
}

long double combinations(long double x , long double y)
{
    long long ans =1;
    for(long double i=0,w=min(y,abs(x-y));i<w;i++){ans *=(x-i)/(i+1);}
    return ans;
}

long long fibonacci(long long x)
{
    if(x==1) return 1;
    if(x==0) return 0;
    return fibonacci(x-1)+fibonacci(x-2);
}

bool isprime(long long n) {
    if(n<2||n%2==0)return false;
    if(n==2)return true;
    for(long long i=3;i<=sqrt(n);i+=2){if(n%i==0)return false;}
    return true;
}

//done buddy
