#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

ifstream f("permutari.in");
ofstream g("permutari.out");

int n,a[10];

int main(){
    f>>n;
    for(int i=1; i<=n; ++i)
        a[i]=i;
    do{
        for(int i=1; i<=n; ++i)
            g<<a[i]<<' ';
        g<<'\n';
    }while(next_permutation(a+1,a+n+1));
    return 0;
}