#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
int ans[(1000000 + 10)];
int main() {
  int n;
  scanf("%d", &n);
  memset(ans, (-1), sizeof(ans));
  if (n == 1) {
    printf("1 1\n");
    return 0;
  }
  int l = 1, r = n;
  ans[l] = ans[r] = 1;
  int j = 3;
  l++, r--;
  while (r > l) {
    ans[l] = ans[r] = j;
    l++, r--;
    j += 2;
  }
  l = n + 1;
  r = n * 2 - 1;
  ans[l] = ans[r] = 2;
  j = 4, l++, r--;
  while (r > l) {
    ans[l] = ans[r] = j;
    l++, r--;
    j += 2;
  }
  printf("%d", ans[1] == -1 ? n : ans[1]);
  for (int i = 2; i <= 2 * n; i++) printf(" %d", ans[i] == -1 ? n : ans[i]);
  printf("\n");
  return 0;
}
