/// Craciun Catalin
///  Permutari
///   www.infoarena.ro/problema/permutari
#include <fstream>
#include <iostream>
#include <algorithm>

#define NMax 8

using namespace std;

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

int fact(int x)
{
    int f=1;
    for (int i=1;i<=x;i++)
        f*=i;

    return f;
}

int main()
{
    int nrPerm=1;
    int maxPerm;
    short n;
    int C[NMax];

    f>>n;
    f.close();

    maxPerm=fact(n);

    for (short i=0;i<n;i++)
        C[i]=i+1;

    for (;nrPerm<=maxPerm;)
    {
        for (short i=0;i<n;i++)
            g<<C[i]<<' ';
        g<<'\n';

        nrPerm++;
        next_permutation(C, C+n);
    }

    return 0;
}