func_code_string: #include <bits/stdc++.h>   using namespace std;   const long long N = 2e5 + 50;   const long long mod = 1e9 + 7;   const long long INF = 1e18;   long long dx[] = {-1, 0, 1, 0};   long long dy[] = {0, 1, 0, -1};   bool compare(const pair<long long, long long>& i,                const pair<long long, long long>& j) {     return i.second > j.second;   }   long long fact[N];   vector<bool> is_prime(100000, true);   vector<long long> prime;   void pre() {     fact[0] = 1;     for (long long i = 1; i < N; i++) {       fact[i] = i * fact[i - 1];       fact[i] %= mod;     }   }   long long modexp(long long x, long long n) {     long long r = 1;     while (n) {       if (n & 1) r = (r * x) % mod;       x = (x * x) % mod;       n >>= 1;     }     return r % mod;   }   long long modinv(long long x) { return modexp(x, mod - 2); }   long long ncr(long long n, long long r) {     if (n < r) return 0;     long long ans =         (fact[n] % mod * modinv(fact[r]) % mod * modinv(fact[n - r]) % mod) % mod;     return ans;   }   long long exp(long long x, long long n) {     long long r = 1;     while (n) {       if (n & 1) r = (r * x);       x = (x * x);       n >>= 1;     }     return r;   }   void solve() {     long long n;     cin >> n;     long long x = 1;     long long A[n + 2];     for (long long i = 1; i <= n; i += 2) {       A[i] = x;       x++;     }     for (long long i = n - n % 2; i >= 2; i -= 2) {       A[i] = x;       x++;     }     for (long long i = 1; i <= n; i++) cout << A[i] <<    ;     cout << endl;     return;   }   int32_t main() {     ios_base::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);     long long t = 1;     for (long long i = 0; i < t; i++) {       solve();     }     return 0;   }   