#pragma comment (linker, "/STACK:256000000") #define _CRT_SECURE_NO_WARNINGS #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; typedef string::const_iterator State; const long double Ma_PI = 3.1415926535897932384626433832795028841971L; #define eps 1e-15L #define LONG_INF 2000000000000000000LL #define GOLD 1.61803398874989484820458 #define MAX_MOD 1000000007LL #define GYAKU 500000004LL #define MOD 998244353LL #define seg_size 262144*2 #define pb push_back #define mp make_pair typedef long long ll; #define REP(a,b) for(long long a = 0;a < b;++a) #define ALL(x) (x).begin(),(x).end() void init() { iostream::sync_with_stdio(false); cout << fixed << setprecision(100); } unsigned long xor128() { static unsigned long x = 123456789, y = 362436069, z = 521288629, w = 88675123; unsigned long t = (x ^ (x << 11)); x = y; y = z; z = w; return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8))); } typedef struct BigInt { string s = "0"; BigInt operator +(BigInt obj) { string c; while (max(obj.s.length(), this->s.length()) + 1 > c.length()) { c.pb('0'); } for (int q = 0; q < obj.s.length(); ++q) { c[c.length() - 1 - q] = obj.s[obj.s.length() - q - 1]; } for (int q = 0; q < this->s.length(); ++q) { c[c.length() - 1 - q] += this->s[this->s.length() - 1 - q] - '0'; if (c[c.length() - 1 - q] > '9') { c[c.length() - 2 - q]++; c[c.length() - 1 - q] -= 10; } } if (c.front() == '0') { c.erase(c.begin()); } return BigInt{ c }; } BigInt operator *(BigInt obj) { BigInt ans; for (int i = this->s.length() - 1; i >= 0; --i) { REP(q, this -> s[i] - '0') { ans = ans + obj; } obj.s.pb('0'); } return ans; } }BigInt; void solve() { int n; cin >> n; if (n == 1) { cout << "1" << endl; return; } for (int i = n - 1; i >= 0; --i) { cout << i; } cout << endl; } #undef int int main() { init(); solve(); }