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

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

int long long  n;

vector<int>v;

int main()
{

    f >> n;
    for(int i = 1 ; i <= n ; i++)
    {

        v.push_back(i);

    }

    do
    {

        for(int i = 0 ; i <n ; i++)
        {

            g<<v[i]<<" ";

        }
        g<<endl;

    }
    while(next_permutation(v.begin(),v.end()));
return 0;
}