#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9;
const int SIZE = 1e6 + 5;
const long long INF = 1LL << 55;
const double eps = 1e-10;
int d[1000009];
int main() {
  int(n);
  scanf("%d", &n);
  if (n % 2) {
    int h = n / 2;
    for (int i = 0; i < (h); ++i) {
      d[i] = d[n - 2 - i] = 2 * (i + 1);
    }
    for (int i = 0; i < (h + 1); ++i) {
      d[i + n - 1] = d[2 * n - 2 - i] = 2 * i + 1;
    }
    d[2 * n - 1] = n;
  } else {
    int h = n / 2;
    for (int i = 0; i < (h); ++i) {
      d[i] = d[n - 1 - i] = 2 * i + 1;
    }
    for (int i = 0; i < (h); ++i) {
      d[i + n] = d[2 * n - 2 - i] = (2 * (i + 1));
    }
    d[2 * n - 1] = n;
  }
  for (int i = 0; i < (2 * n); ++i) printf("%d ", d[i]);
}
