#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair<ll, ll>
#define sz(x) (int)((x).size())
#define all(a) (a).begin(), (a).end()

/* int f[maxn],nf[maxn],inv[maxn];
const int M=998244353;
void init(){
    inv[1]=1; for (int i=2;i<maxn;i++) inv[i]=M-1ll*(M/i)*inv[M%i]%M;
    f[0]=nf[0]=1; for (int i=1;i<maxn;i++) f[i]=1ll*f[i-1]*i%M,nf[i]=1ll*nf[i-1]*inv[i]%M;
}
int C(int x,int y){return 1ll*f[x]*nf[y]%M*nf[x-y]%M;}*/
const ll mod = 1e9+7;
ll n, k, m, mi, ma;
bool u = 0;
bool ans[20];

ifstream fin("submultimi.in");
ofstream fout("submultimi.out");

void write(){
		for(int i = 0; i<n; i++) if(ans[i]) fout << i + 1 << " ";
		fout << "\n";
		return;
}

void aaa(int x){
	
	if(x == n)	return;
	
	ans[x] = 1;
	write();
	aaa(x + 1);
	ans[x] = 0;
	aaa(x + 1);
	
}


void solve(){
	
	fin >> n;
	aaa(0);
	
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int t=1;
	//cin >> t;
	while(t--) solve();
	
	return 0;
}