#include <bits/stdc++.h>

using namespace std;

ifstream fin("permutari.in");
ofstream fout("permutari.out");

int n,s[10],viz[10];

/**void backt(int i)
{
    if(i>n)
    {
        for(int j=1;j<=n;j++)
            fout<<s[j]<<" ";
        fout<<"\n";
    }
    else for(int j=1;j<=n;j++)
        if(!viz[j])
        {
            s[i]=j;
            viz[j]=1;
            backt(i+1);
            viz[j]=0;
        }
}**/
vector<int>v;
void rezolvare_stl()
{
    for(int i=1;i<=n;i++)
        v.push_back(i);
    do{
        for(int i=0;i<n;i++)
            fout<<v[i]<<" ";
        fout<<"\n";
    } while(next_permutation(v.begin(),v.end()));
}

int main()
{
    fin>>n;
    //backt(1);
    rezolvare_stl();
    return 0;
}