#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
const int mo = 1e9 + 7;
int ans, f, n, m, h, s;
int a[maxn], c[maxn], k, sum[maxn];
int b[maxn], flag, tmp;
int dp[maxn];
int main() {
  int T;
  int cas = 1;
  while (cin >> n) {
    flag = 0;
    cout << n << " ";
    for (int i = 1; i <= n - 1; i++) cout << i << " ";
    cout << endl;
  }
  return 0;
}
