#pragma region header #define _GLIBCXX_DEBUG #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define int long long #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define rep1(i, n) for (int i = 1; i <= (int)(n); i++) #define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--) #define rev1(i, n) for(int i = (int)(n); i > 0; i--) #define pb push_back #define ts to_string #define all(v) (v).begin(), (v).end() #define resort(v) sort((v).rbegin(), (v).rend()) #define vi vector #define vvi vector> #define vc vector #define vvc vector> #define vb vector #define vvb vector> #define vs vector #define vvs vector > #define pq priority_queue #define smallpq priority_queue, greater> using ll = long long; using P = pair; /* ----------------よく使う数字や配列----------------- */ int dx[] = { 1,0,-1,0 }; int dy[] = { 0,1,0,-1 }; constexpr ll mod = 1e9 + 7; constexpr ll inf = INT32_MAX / 2; constexpr ll INF = LLONG_MAX / 2; constexpr long double eps = DBL_EPSILON; constexpr long double pi = 3.141592653589793238462643383279; /* ----------------------end----------------------- */ /* --------------------テンプレート------------------ */ template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } /* ----------------------end----------------------- */ /* --------------------ライブラリ-------------------- */ ll fact(int i) { //階乗 if (i == 0) return 1; return (fact(i - 1)) * i % mod; } ll gcd(ll a, ll b) { //最大公約数 if (b == 0) return a; return gcd(b, a % b); } ll lcm(ll a, ll b) { //最小公倍数 return a * b / gcd(a, b); } bool isprime(ll a)//素数判定、primeならtrue,違うならfalse { if (a < 2) return false; else if (a == 2) return true; else if (a % 2 == 0) return false; double m = sqrt(a); for (int i = 3; i <= m; i += 2) { if (a % i == 0) { return false; } } // 素数である return true; } ll keta(ll n) { //桁数を求める if (n == 0) return 1; int count = 0; while (n != 0) { n /= 10; count++; } return count; } ll ketasum(ll n) { //各桁の和 ll sum = 0; while (n != 0) { sum += n % 10; n /= 10; } return sum; } /* ----------------------end----------------------- */ #pragma endregion signed main() { string S; getline(cin, S); cout << S << endl; }