//
//  Submultimi.cpp
//  BinarySearch
//
//  Created by Cristina Radulescu on 10/26/16.
//  Copyright © 2016 Cristina Radulescu. All rights reserved.
//

#include <cmath>
#include <cstdio>
#include <vector>
#include <stack>
#include <iostream>
#include <algorithm>
using namespace std;

int No;
int solut[1000005];
int vizi[1000005];

void submultimi(int k, int n){
    if(k == n+1){
        for(int i = 1; i <= n; ++i){
            printf("%d ", solut[i]);
        }
        printf("\n");
    }
    
    for(int i = solut[k-1]; i <= No; ++i){
        if(!vizi[i]){
            vizi[i] = 1;
            solut[k] = i;
            submultimi(k+1, n);
            vizi[i] = 0;
        }
    }
    
}

int main(){
    freopen("submultimi.in", "r", stdin);
    freopen("submultimi.out","w", stdout);
    
    scanf("%d", &No);
    solut[0] = 1;
    for(int k = 1; k <= No; ++k)
        submultimi(1, k);
}