#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
int n,i;
vector<int> a;
ifstream f("permutari.in");
ofstream g("permutari.out");
void afis() {
    int i;
    for (i=0;i<n;i++)
            g<<a[i]<<' ';
        g<<'\n';
    return;
}
int main()
{
    f>>n;
    for (i=1;i<=n;i++)
        a.push_back(i);
    do afis(); while (next_permutation(a.begin(),a.end()));
    return 0;
}