#include <algorithm>
#include <fstream>
using namespace std;
int N;
int fact(int N) {
    int mid=1;
    for (int i=2; i<=N; i++)
     mid=mid*i;
    return mid;

}
int main()
{
    ifstream in;
    in.open("permutari.in");
    ofstream out;
    out.open("permutari.out");
    in >> N;
    int perm[N];
    for (int i=0;i<N;i++) {
        perm[i]=i+1;
    }
    for (int i=0;i<N;i++)
        {
            out << perm[i] << " ";
        }
        out << "\n";
    for (int j=0;j<fact(N)-1;j++) {
        next_permutation(perm,perm+N);
        for (int i=0;i<N;i++)
        {
            out << perm[i] << " ";
        }
        out << "\n";
    }
    out.close();
    return 0;
}