#include <bits/stdc++.h>
using namespace std;
long long int n;
void solve() {
  cin >> n;
  vector<long long int> v(2 * n + 1);
  long long int left = 1, right = n + 1;
  for (long long int i = 1; i <= n; i++) {
    if (i & 1) {
      v[left] = v[left + (n - i)] = i;
      left++;
    } else {
      v[right] = v[right + (n - i)] = i;
      right++;
    }
  }
  for (long long int i = 1; i <= 2 * n; i++) {
    if (v[i] == 0) {
      v[i] = n;
    }
    cout << v[i] << " ";
  }
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
