#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ld        long double
#define vi        vector<ll>
#define pi        pair<ll,ll>
#define all(x)    x.begin(), x.end()
#define allr(x)   x.rbegin(), x.rend()
#define sz(x)     ((int)x.size())
#define ln(x)     ((int)x.length())
#define mp        make_pair
#define pb        push_back
#define ff        first
#define ss        second
#define dbg(x)    cout << #x << ": " << x
#define clr(x,v)  memset(x, v, sizeof(x))
#define fix(x)    cout << setprecision(x) << fixed;
#define fo(i,a,b) for(int i=(a);i<=(b);i++)

template<typename T1, typename T2>istream& operator>>(istream& in, pair<T1, T2> &a) {in >> a.fr >> a.sc; return in;}
template<typename T1, typename T2>ostream& operator<<(ostream& out, pair<T1, T2> a) {out << a.fr << " " << a.sc; return out;}
template<typename T, typename T1>T amax(T &a, T1 b) {if (b > a)a = b; return a;}
template<typename T, typename T1>T amin(T &a, T1 b) {if (b < a)a = b; return a;}

const double PI = acos(-1.0);
const double eps = 1e-9;
const ll mod = 1e9 + 7;
const ld r = 1e9;
const ll inf = 1e17;
const int MAXN = 105;
const int N = 1e5 + 5;


ll max(ll a, ll b)
{
	if (a > b) return a;
	else return b;
}

ll min(ll a, ll b)
{
	if (a < b) return a;
	else return b;
}

ll power(ll a, ll p) {
	ll res = 1;
	while (p) {
		if (p & 1) {
			res = ((res)  * (a) ) ;
		}
		a = ((a ) * (a));
		p >>= 1;

	}
	return res;

}

void solve() {
	int n, i, j, x;
	cin >> n;
	cout << n;

}

int main() {

	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
// #ifndef ONLINE_JUDGE

// 	// For getting input from input.txt file
// 	freopen("input.txt", "r", stdin);

// 	// Printing the Output to output.txt file
// 	freopen("output.txt", "w", stdout);
// #endif

	ll t = 1;
	//cin >> t;
	//ll tt = 0;
	while (t--) {
		//tt++;

		solve();
	}

	return 0;
}