#include <iostream>
#include<fstream>
#include<algorithm>
using namespace std;
int n, v[10];
ifstream f("permutari.in");
ofstream g("permutari.out");

void afisare()
{
  for(int i = 1; i <= n; i++)
    g << v[i] << " "; 
  g << endl;
}

int main()
{
    int p=1;
    f>>n;
    
 
    for(int i=1; i<=n; ++i) v[i]=i; afisare();
    for(int i=1; i<=n; ++i) p*=i;
    for(int i=2; i<=p; ++i)
    next_permutation(v, v+n+1), afisare();
 
 
    return 0;
}