#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
int n, a[1000001], l1, r1, l2, r2;
stack<int> s1, s2;
int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> n;
  l1 = 1, r1 = n, l2 = n + 1, r2 = 2 * n - 1;
  for (int i = n - 1; i >= 1; i--) i % 2 ? s1.push(i) : s2.push(i);
  while (!s1.empty()) {
    a[l1] = s1.top();
    a[r1] = s1.top();
    s1.pop();
    l1++, r1--;
  }
  while (!s2.empty()) {
    a[l2] = s2.top();
    a[r2] = s2.top();
    s2.pop();
    l2++, r2--;
  }
  for (int i = 1; i < 2 * n + 1; i++) {
    if (a[i]) {
      cout << a[i] << " ";
    } else {
      cout << n << " ";
    }
  }
  return 0;
}
