#include <iostream>
#include <deque>
#include <fstream>
using namespace std;
ifstream in("fisier.in");
ofstream out("fisier.out");
int n, a[20];
deque<int> q;
void back_track(int n,int p)
{
    if ( p > n )
    {
        for ( auto c:q)
            out << c << " ";
        out << "\n";
        return;
    }
    for ( int i = 1; i <= n; ++i )
    {
        if ( a[i] == 0 )
        {

            a[i] = 1;
            q.emplace_back(i);
            back_track(n, p+1);
            a[i] = 0;
            q.pop_back();
        }
    }
}
int main()
{
    in >> n;
    back_track(n, 1);
    return 0;
}