#include <bits/stdc++.h>

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
int inf=1000000007;
ll infl=1000000000000000007;
int mod=998244353;

bool is[1007];
vector<int>W[1007];

vector<int>calc(ll m)
{
    if(m<=45) return W[m];
    vector<int>t1=calc(m/2),T1;
    for(auto x:W[m%2+1]) T1.pb(x+sz(t1)+sz(W[2]));
    for(auto x:W[2]) T1.pb(x);
    for(auto x:t1) T1.pb(x+sz(W[2]));
    vector<int>t2=calc(m/5),T2;
    for(auto x:W[m%5+1]) T2.pb(x+sz(t2)+sz(W[5]));
    for(auto x:W[5]) T2.pb(x);
    for(auto x:t2) T2.pb(x+sz(W[5]));
    vector<int>t3=calc(m/11),T3;
    for(auto x:W[m%11+1]) T3.pb(x+sz(t3)+sz(W[11]));
    for(auto x:W[11]) T3.pb(x);
    for(auto x:t3) T3.pb(x+sz(W[11]));

    vector<int> res=T1;
    if(sz(T2)<sz(res)) res=T2;
    if(sz(T3)<sz(res)) res=T3;
    return res;
}

vector<int>construct_permutation(ll m)
{
    for(int n=1;n<=7;n++)
    {
        vector<int>p(n);
        for(int i=0;i<n;i++) p[i]=i;
        while(true)
        {
            vector<int>DP(n);
            int act=1;
            for(int i=0;i<n;i++)
            {
                DP[i]=1;
                for(int j=0; j<i; j++) if(p[j]<p[i]) DP[i]+=DP[j];
                act+=DP[i];
            }
            if(!is[act])
            {
                is[act]=1;
                W[act]=p;
            }
            if(!next_permutation(all(p))) break;
        }
    }
    return calc(m);
}

int cnt(vector<int>p)
{
    int n=sz(p);
    vector<int>DP(n);
    int act=1;
    for(int i=0;i<n;i++)
    {
        DP[i]=1;
        for(int j=0; j<i; j++) if(p[j]<p[i]) DP[i]+=DP[j];
        act+=DP[i];
    }
    return act;
}

/*
signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    vector<int>w=construct_permutation(123456);
    for(auto x:w) cout<<x<<" ";
    cout<<endl<<cnt(w);

    return 0;
}*/