#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<int> sq;
  for (int i = 2; i * i <= n; ++i) {
    sq.emplace_back(i * i);
  }
  vector<vector<int>> v(n + 1);
  FOR(i, 1, n + 1) {
    int x = i;
    for (const int e : sq) {
      if (e > x) break;
      while (x % e == 0) x /= e;
    }
    v[x].emplace_back(i);
  }
  vector<int> ans(n + 1);
  FOR(i, 1, n + 1) {
    const int l = v[i].size();
    REP(j, l) ans[v[i][j]] = v[i][l - 1 - j];
  }
  FOR(i, 1, n + 1) cout << ans[i] << " \n"[i == n];
  return 0;
}