// clang-format off
// There is No Misaka for Codeforces. /dk

#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(x) cerr << #x << ": " << (x) << endl;
#define debugf(fmt, args...) fprintf(stderr, fmt, ##args)
#else
#define debug(...) void(114514);
#define debugf(...) void(1919810);
#endif
namespace FastIO  // Powered By LgxTpre. <3 <3 <3
{
#define int long long
	template <typename T = int>
	inline T read() {
		T s = 0, w = 1; char c = getchar();
		while (!isdigit(c)) { if (c == '-') w = -1; c = getchar(); }
		while (isdigit(c)) s = (s << 1) + (s << 3) + (c ^ 48), c = getchar();
		return s * w;
	}
	template <typename T>
	inline void read(T &s) {
		s = 0; int w = 1; char c = getchar();
		while (!isdigit(c)) { if (c == '-') w = -1; c = getchar(); }
		while (isdigit(c)) s = (s << 1) + (s << 3) + (c ^ 48), c = getchar();
		s = s * w;
	}
	template <typename T, typename... Args> inline void read(T &x, Args &...args) { read(x), read(args...); }
	template <typename T>
	inline void write(T x, char ch) {
		if (x < 0) x = -x, putchar('-');
		static char stk[25]; int top = 0;
		do { stk[top++] = x % 10 + '0', x /= 10; } while (x);
		while (top) putchar(stk[--top]);
		putchar(ch);
		return;
	}
#undef int
}  // namespace FastIO

struct ModTools {
#define int long long
	ModTools(int MODD = 1e9 + 7) : MOD(MODD) { }
	void ChangeMod(int MODD) { MOD = MODD; }
	inline void Madd(int &a, int b) { a = a + b >= MOD ? a + b - MOD : a + b; }
	inline void Msub(int &a, int b) { a = a - b < 0 ? a - b + MOD : a - b; }
	inline void Mmul(int &a, int b) { a = a * b % MOD; }
	inline int add(int a, int b) { return (a + b >= MOD) ? (a + b - MOD) : (a + b); }
	inline int mul(int a, int b) { return (a % MOD) * (b % MOD) % MOD; }
	inline int sub(int a, int b) { return (a - b < 0) ? (a - b + MOD) : (a - b); }
	template <typename... Args> inline int add(int a, int b, Args &...args) { return add(a, add(b, args...)); }
	template <typename... Args> inline int mul(int a, int b, Args &...args) { return mul(a, mul(b, args...)); }
	template <typename... Args> inline void Madd(int &a, int b, Args &...args) { Madd(a, add(b, args...)); }
	template <typename... Args> inline void Mmul(int &a, int b, Args &...args) { Mmul(a, mul(b, args...)); }
	inline int inv(int x) {
		int A = 0, B = 0;
		int d = exgcd(x, MOD, A, B);
		assert(d == 1);
		return sub(A, 0);
	}
	inline int fastpow(int base, int index) {
		int ans = 1;
		while (index) {
			if (index & 1) ans = mul(ans, base);
			base = mul(base, base);
			index >>= 1;
		}
		return ans;
	}
	inline int sqr(int x) { return mul(x, x); }
private:
	int exgcd(int A, int B, int &X, int &Y) {
		if (B == 0) {
			X = 1, Y = 0;
			return A;
		}
		int res = exgcd(B, A % B, X, Y);
		int temp = Y;
		Y = X - A / B * Y;
		X = temp;
		return res;
	}
	int MOD;
#undef int
};

namespace NumberTheory {
	inline int gcd(int A, int B) {
		int C;
		while (B) C = B, B = A % B, A = C;
		return A;
	}
	int exgcd(int A, int B, int &X, int &Y) {
		if (B == 0) {
			X = 1, Y = 0;
			return A;
		}
		int res = exgcd(B, A % B, X, Y);
		int temp = Y;
		Y = X - A / B * Y;
		X = temp;
		return res;
	}
}  // namespace NumberTheory
// clang-format on
namespace Larry76 {
#define int long long
	
#define stlall(x) (x).begin(), (x).end()
#define arrall(x) (x) + 1, (x) + 1 + n
#define fore(name, start, end) for(int name = start; name <= end; ++ name)
#define backward(name, start, end) for(int name = end; name >= start; -- name)
#define stlsiz(x) ((int)(x).size())
#define stlmax(x) (*max_element(stlall(x)))
#define stlmin(x) (*min_element(stlall(x)))
#define OK puts("Yes");
#define FAILED puts("No");
#define open(file) freopen(#file".in","r",stdin); freopen(#file".out","w",stdout);
	
	using namespace FastIO;
	using namespace NumberTheory;
	const int MAX_SIZE = 2e5 + 100;
	const int INF = 0x7f7f7f7f7f7f7f7fll;
	const double eps = 1e-9;
	using i128 = __int128_t;
	struct pii {
		int x, y;
		inline bool operator < (const pii &oth) const{
			if(x==oth.x)
				return y < oth.y;
			return x < oth.x;
		}
	};
	typedef vector<int> veci;
	ModTools mt;
	inline int sqr(int x) { return x * x; }
	inline int random(int l, int r){
		static mt19937_64 rnd(time(0));
		uniform_int_distribution<int> dist(l,r);
		return dist(rnd);
	}
	
	int fac[MAX_SIZE];
	int ifac[MAX_SIZE];
	void initfac(int n){
		fac[0] = 1;
		for(int i=1;i<=n;i++) {
			fac[i] = mt.mul(fac[i - 1], i);
		}
		ifac[n] = mt.inv(fac[n]);
		for(int i=n-1;i>=0;--i) {
			ifac[i] = mt.mul(ifac[i + 1], i + 1);
		}
	}
	
	inline int C(int n, int m) { // n choose m
		return mt.mul(fac[n],ifac[m],ifac[n-m]);
	}
	
	inline int A(int m, int n) { // A_n^m
		return mt.mul(fac[n],ifac[m]);
	}
	
	inline int lowbit(int x) {
		return x & (-x);
	}
	
///////////// Start Coding //////////////
	
	void solve() {
		int x = read();
		putchar(x);
	}
	
	void main() {
//		int T = read();
		int T = 1;
		while(T--){
			solve();
		}
		return void();
	}
	
////////////// End Coding ///////////////
#undef int
}  // namespace Larry76

int main() {
#ifdef LOCAL
	time_t t1 = clock();
//	open(buf);
#endif
	Larry76::main();
#ifdef LOCAL
	time_t t2 = clock();
	fprintf(stderr, "Used Time: %lldms.\n", t2 - t1);
#endif
	return 0 ^ 0;
}