#include <bits/stdc++.h>
using namespace std;
template <class T>
bool umin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool umax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
int p[100009];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) p[i] = i;
  if (n & 1) {
    for (int i = n; i > 1; i -= 2) swap(p[i], p[i - 1]);
  } else {
    for (int i = 1; i < n; i += 2) swap(p[i], p[i + 1]);
  }
  for (int i = 1; i <= n; i++) printf("%d ", p[i]);
  puts("");
  return 0;
}
