#include <fstream>
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;
short int N;
vector<short int> Stack;

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

int main()
{
   fin >> N;
   for(short int i = 1; i <= N; i++)
   {
       Stack.push_back(i);
       fout<<Stack[i-1]<<' ';
   }
   fout<<'\n';

   while(next_permutation(Stack.begin(), Stack.end()))
   {
       for(short int i = 0; i < N; i++)
           fout<<Stack[i]<<' ';
       fout<<'\n';
   }
}