#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

int n;
vector <int> st;

FILE *f = fopen("permutari.in", "r");
FILE *g = fopen("permutari.out", "w");

void citire(){

    fscanf(f,"%d", &n);
}

void afis(){

    for(int i = 0; i < n; i++)
        fprintf(g,"%d ", st[i]);
    fprintf(g,"\n");
}

void init(){

    for(int i = 1; i <= n; i++)
        st.push_back(i);
}

void back(int k){

    init();

    do{
        afis();

    }while(next_permutation(st.begin(), st.end()));
}

int main()
{
    citire();
    back(1);

    return 0;
}