#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
using namespace std;
long long int n, ans[1000005];
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n;
  if (n == 1) {
    return cout << "1 1", 0;
  } else if (n == 2) {
    return cout << "1 1 2 2", 0;
  }
  long long int l = 1, r = n;
  for (long long int i = 1; i < n; i += 2) {
    ans[l] = ans[r] = i;
    l++;
    r--;
  }
  l = n + 1;
  r = n + n - 1;
  for (long long int i = 2; i < n; i += 2) {
    ans[l] = ans[r] = i;
    l++;
    r--;
  }
  for (long long int i = 1; i <= n + n; i++) {
    if (ans[i] == 0) {
      ans[i] = n;
    }
  }
  for (long long int i = 1; i <= n + n; i++) {
    cout << ans[i] << ' ';
  }
}
