#include <algorithm>
using namespace std;

#define DIM 10

int v[DIM];
int n;

void solve ()
{
    int i;

    for (i=1; i<=n; ++i)
        v[i]=i;

    do
    {
        for (i=1; i<=n; ++i)
            printf ("%d ",v[i]);
        printf ("\n");
    }
    while (next_permutation (v+1,v+n+1));

}

int main ()
{
    freopen ("permutari.in","r",stdin);
    freopen ("permutari.out","w",stdout);

    scanf ("%d",&n);
    solve ();

    return 0;
}