#include <cstdio>
#include <algorithm>

using namespace std;
int i,aux,n,b,k,j,p,st[100],m,s;

void init(int x)
{
    int j;
    for(j=1;j<=x;j++)
        st[j]=0;
}

void tipar(int x)
{
    int j;
    for(j=1;j<=x;j++)
        printf("%d ",st[j]);
    printf("\n");
}


void back(int vf)
{
    int k;
    for(k=st[vf-1]+1;k<=n;k++)
    {
        st[vf]=k;
            //if (vf==n)
            tipar(vf);
                    //else
                    back(vf+1);
    }
}


int main()
{
    freopen ("submultimi.in","r",stdin);
    freopen ("submultimi.out","w",stdout);

    scanf("%d",&n);
    back(1);

}