#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  scanf("%d", &n);
  int* x = new int[2 * n];
  int odd = 0;
  int even = n;
  int len = n - 1;
  for (int len = n - 1, i = 1; len > 0; len--, i++)
    if (i % 2 == 1) {
      x[odd] = i;
      x[odd + len] = i;
      odd++;
    } else {
      x[even] = i;
      x[even + len] = i;
      even++;
    }
  x[2 * n - 1] = n;
  if (n % 2 == 0)
    x[even] = n;
  else
    x[odd] = n;
  int s = 0;
  for (int i = 0; i < 2 * n; i++) printf("%d ", x[i]);
  return 0;
}
