#include <bits/stdc++.h>
using namespace std;
const int N = 500100;
int n, p[2 * N];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < (n / 2 - 1 + (n % 2)); ++i) {
    p[n / 2 - 2 - i + (n % 2)] = p[n / 2 + i + (n % 2)] =
        (n / 2 - i - 1) * 2 + (n % 2);
  }
  p[n / 2 - 1 + (n % 2)] = n;
  int cent = n / 2 * 2 + (n + 1) / 2 + (n % 2);
  for (int i = 0; i < ((n + 1) / 2); ++i) {
    p[cent - 1 - i] = p[cent + i] = 2 * (n / 2 - i) - 1 + (n % 2);
  }
  p[n / 2 * 2 - 1 + (n % 2) * 2] = n;
  for (int i = 0; i < (2 * n); ++i) printf("%d ", p[i]);
  printf("\n");
}
