#include<bits/stdc++.h>
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
#define lastbit(i) __builtin_ctz(i)
const long long inf=1e18+9;
long long cal(const vector<int>&vl){
if (vl.empty())return 1;
vector<long long>dp;
dp.resize(sz(vl));
long long ans=1;
for1(j,0,sz(vl)-1){
dp[j]=1;
for1(k,0,j-1){
if (vl[k]<vl[j]){
dp[j]+=dp[k];
}
}
ans=min(inf,ans+min(dp[j],inf));
}
return ans;
}
vector<int> construct_permutation(long long k){
vector<int>ans;
long long nw=1;
while (k>nw){
for (auto &v:ans){
v++;
}
//cerr<<k<<'\n';
/*cerr<<nw<<'\n';
for (auto v:ans){
cerr<<v<<" ";
}
cerr<<'\n';*/
int szz=sz(ans);
//cerr<<k<<" "<<szz<<'\n';
for1(j,0,szz){
//cerr<<j<<" "<<szz<<'\n';
vector<int>newans;
for1(k1,0,j-1){
newans.pb(ans[k1]);
//cerr<<k1<<'\n';
}
newans.pb(0);
for1(k1,j,sz(ans)-1){
newans.pb(ans[k1]);
//cerr<<k1<<'\n';
}
long long value=cal(newans);
if (value<=k){
nw=value;
ans=newans;
//cerr<<sz(newans)<<" "<<j<<" "<<value<<'\n';
break;
}
}
}
return ans;
}
/*signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
//freopen(".INP","r",stdin);
//freopen(".OUT","w",stdout);
for1(i,2,90){
vector<int>vl=construct_permutation(i);
vector<int>dp;
dp.resize(sz(vl));
long long ans=1;
for1(j,0,sz(vl)-1){
dp[j]=1;
for1(k,0,j-1){
if (vl[k]<vl[j]){
dp[j]+=dp[k];
}
}
ans+=dp[j];
}
if (ans!=i){
cout<<"vcl "<<i<<" "<<ans<<'\n';
for1(j,0,sz(vl)-1){
cout<<vl[j]<<" ";
}
return 0;
}
}
vector<int>vl=construct_permutation(3);
for (auto v:vl){
cout<<v<<" ";
}
}*/
