#include <bits/stdc++.h>
#pragma optimise GCC(-O2)
using namespace std;
mt19937_64 rang(
    chrono::high_resolution_clock::now().time_since_epoch().count());
int rng(int lim) {
  uniform_int_distribution<int> uid(0, lim - 1);
  return uid(rang);
}
long long INF = LLONG_MAX;
const long long M = 1000000007;
long long powm(long long, long long);
long long perm[2000005];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n;
  cin >> n;
  for (int i = 0; i < 2000005; i++) perm[i] = -1;
  for (int i = 1; i < n + 1; i++) perm[i] = i;
  for (int i = 2; i < n + 1; i++) {
    long long to_be = -1;
    long long replace = 0;
    while (replace * i + 1 <= n) {
      swap(to_be, perm[replace * i + i - 1]);
      replace++;
    }
    swap(to_be, perm[n + i - 1]);
  }
  for (int i = 0; i < 2000005; i++)
    if (perm[i] != -1) cout << perm[i] << " ";
}
long long powm(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a) % M;
    a = (a * a) % M;
    b >>= 1;
  }
  return res;
}
