#include <bits/stdc++.h>
#include <vector>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using str=string;
using ll=long long;
using pint=pair<int,int>;
using pll=pair<ll,ll>;
using pque_int=priority_queue<int>;
using vint=vector<int>;
using vll=vector<ll>;
using vvint=vector<vector<int>>;
using vvll=vector<vector<ll>>;
using vstr=vector<string>;
int inf=2'000'000'000;
ll infll=1'000'000'000'000'000'000ll;
#define rep(i,n) for (int i=0; i < (int) n; i++)
#define rep1(i,n) for (int i=1; i < (int) n; i++)
template<typename T> inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); }
template<typename T> inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); }
#define all(x) (x).begin(),(x).end()
template <typename T>
T VecMax(vector<T> &v) {
    T output=-inf;
    rep(i,v.size()) chmax(output,v[i]);
    return output;
}
template <typename T>
T VecMin(vector<T> &v) {
    T output=inf;
    rep(i,v.size()) chmin(output,v[i]);
    return output;
}
template <typename T>
T VecSum(vector<T> &v) {
    T output=0;
    rep(i,v.size()) output+=v[i];
    return output;
}
ll pow(ll a,ll n) {
    ll output=1;
    while (n>0) output*=a;
    return output;
}
template<class... T>
    void input(T&... a){
    (cin >> ... >> a);
}
template<typename T>
void print(T s) {
    cout << s << endl;
}
template<class T>
T power_mod(T a, T b, T m) {
    T p = a, Answer = 1;
    for (int i = 0; i < 64; i++) {
        T wari = (T(1) << i);
        if ((b / wari) % 2 == 1) {
            Answer = (Answer * p) % m;
        }
    p = (p * p) % m;
    }
    return Answer;
}
int len(string s) {return s.size();}
vint dx{1,0,-1,0};
vint dy{0,1,0,-1};
int opmax(int a, int b) { return max(a,b);}
int opmin(int a, int b) { return min(a,b);}
int e0() { return (int)(0);}
int einf() {return (int)(1e9);}
int main() {
    int N;
    cin >> N;
    cout << N*N << endl;

}