#include <bits/stdc++.h>
using namespace std;
using ll = long long;
namespace {
vector<int> primes = {2, 3, 5};
deque<int> q;
int lim;
void mult(int x){
for (int i = lim + x - 2; i >= lim; i--){
q.push_back(i);
}
lim += x - 1;
}
void add(int x){
for (int i = 0; i < x; i++) q.push_front(lim++);
}
void solve(ll k){
if (k == 1) return;
for (int i = (int)primes.size() - 1; i >= 0; i--){
if (k % primes[i] == 0){
solve(k / primes[i]);
mult(primes[i]);
return;
}
}
if (k > 2 && (k - 2) % 5 == 0){
solve(k - 2);
add(2);
}
else{
solve(k - 1);
add(1);
}
return;
}
}
vector<int> construct_permutation(ll k){
lim = 0;
solve(k);
vector<int> v;
while (!q.empty()){
v.push_back(q.front());
q.pop_front();
}
return v;
}
