#include <bits/stdc++.h>
using namespace std;
int n;
int ar[1000005];
int main() {
  cin >> n;
  int p1 = 1;
  int p2 = n + 1;
  int sz = n - 1;
  int i, j;
  for (i = 0; i < n - 1; ++i) {
    if (!(i & 1)) {
      ar[p1] = i + 1;
      ar[p1 + sz] = i + 1;
      p1++;
    } else {
      ar[p2] = i + 1;
      ar[p2 + sz] = i + 1;
      p2++;
    }
    sz--;
  }
  for (i = 1; i < 2 * n + 1; ++i) {
    if (ar[i] == 0) ar[i] = n;
  }
  for (i = 1; i < 2 * n + 1; ++i) printf("%d ", ar[i]);
  cout << endl;
}
