#include <fstream>
#include <algorithm>

using namespace std;
int a,n,i,v[9];
ifstream in("permutari.in");
ofstream out("permutari.out");
int fact(int a)
{
    if(a==1) return 1;
    return a*fact(a-1);
}
int main()
{
in>>n;

for(i=0;i<n;i++)
    {v[i]=i+1;out<<i+1<<" ";}
int j=1;
out<<'\n';
for(j=1;j<=fact(n)-1;j++)
{
    if(next_permutation(v,v+n)==true)
    {for(i=0;i<n;i++)
    out<<v[i]<<" ";
out<<'\n';}
}
    return 0;
}