#include <algorithm>
using namespace std;

int n,m;

void solve ()
{
    int i,j;

    for (m=(1<<n), i=1; i<m; ++i)
    {
        for (j=1; j<=n; ++j)
            if (i&(1<<(j-1)))
                printf ("%d ",j);
        printf ("\n");
    }
}

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

    scanf ("%d",&n);
    solve ();

    return 0;
}