#include <bits/stdc++.h>
const unsigned long long inf = 1LL << 61;
const double eps = 1e-5;
using namespace std;
bool cmp(int a, int b) { return a > b; }
int a[1000000 + 10];
int main() {
  int n;
  while (cin >> n) {
    for (int i = 1; i <= 2 * n; i++) a[i] = n;
    int num1 = 1, num2 = n + 1;
    for (int i = 1; i <= n; i++) {
      int x, y;
      if (i & 1) {
        x = num1;
        y = n - num1 + 1;
        num1++;
      } else {
        x = num2;
        y = 2 * n - (num2 - n);
        num2++;
      }
      a[x] = i;
      a[y] = i;
    }
    for (int i = 1; i <= 2 * n; i++) {
      printf("%d ", a[i]);
    }
    printf("\n");
  }
  return 0;
}
