#include <iostream>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
void back(int step,int start,int n,int k,vector<int>&sol){
	if(step==k){
		for(int i=0;i<sol.size();i++){
			printf("%d ",sol[i]);
		}
		printf("\n");
		return;
	}
	for(int i=start;i<n;i++){
		step++;
		sol.push_back(i+1);
		back(step,i+1,n,k,sol);
		sol.pop_back();
		step--;
	}
	return;
}
int main(){
	int n;
	freopen("submultimi.in","r",stdin);
	freopen("submultimi.out","w",stdout);
	scanf("%d",&n);
	vector<int> sol;
	for(int k=0;k<n;k++){
		back(0,0,n,k+1,sol);
	}
	return 0;
}