#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;

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

vector<int>S;

int main()
{
    int n;
    f>>n;
    for(int i=1;i<=n;i++)
        S.push_back(i);
    do
    {
        for(int i=0;i<n;i++)
            g<<S[i]<<' ';
        g<<'\n';
    }while(next_permutation(S.begin(),S.end()));
    f.close();
    g.close();
    return 0;
}