#include <bits/stdc++.h>
const double pi = acos(-1);
long long binpow(long long a, long long b) {
  long long res = 1;
  while (b != 0) {
    if (b & 1) res *= a, res %= 1000000007;
    a *= a, a %= 1000000007;
    b >>= 1;
  }
  return res % 1000000007;
}
using namespace std;
struct node {
  long long l, m, r;
};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n;
  cin >> n;
  vector<long long> ans(2 * n);
  int l = 0, r = n - 1, cur = 1;
  while (l <= r) {
    if (l == r) {
      ans[l] = ans[2 * n - 1] = cur;
      break;
    }
    ans[l] = ans[r] = cur;
    l++, r--, cur += 2;
  }
  l = n, r = 2 * n - 2, cur = 2;
  while (l <= r) {
    if (l == r) {
      ans[l] = ans[2 * n - 1] = cur;
      break;
    }
    ans[l] = ans[r] = cur;
    l++, r--, cur += 2;
  }
  for (int i = 0; i < 2 * n; i++) cout << ans[i] << ' ';
  cout << "\n";
}
