#include <bits/stdc++.h>
int i, j, m, d, a1, a2, s, b1, n, k, x, y, l, pos, v, b, smin, c[101], a,
    last[100];
void sol() {
  printf("%d", n);
  for (i = 1; i <= n - 1; i++) {
    printf(" %d", i);
  }
  printf("\n");
}
int main() {
#pragma comment(linker, "/STACK:16777216")
  while (scanf("%d", &n) != EOF) {
    sol();
  }
}
