#include <iostream>
#include <fstream>
#include <stack>
using namespace std;
const int maxn=20;
int top,st[maxn];
ifstream fin("submultimi.in");
ofstream fout("submultimi.out");
int n;
void back (int k)
{
    if (k==n+1)
       {   if (top!=0)
           {for (int i=1;i<=top;i++)
              fout<<st[i]<<" ";
            fout<<"\n";
           }
           return;

       }
    back(k+1);
    //alegeme elementul
    st[++top]=k;
    back(k+1);
    --top;
}
int main()
{
  fin>>n;
  back(1);

    return 0;
}