#include<stdio.h>

int n;
int a[10];
int frcv[10];

int afisare()
{
    int i;
    for(i = 1; i <= n; i++)
     printf("%d ",a[i]);
    printf("\n");
    return 0;
}

int valid(int k)
{

    for(int i = 1; i < k; i++)
     if (a[i] == a[k]) return 0;
    return 1;
}

int back(int i)
{
    int j = 1;
    for(j = 1; j <= n; j++)
    {
    a[i] = j;
    if (valid(i))
     if (i == n) afisare();
                  else
                   back(i+1);
     }


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

    scanf("%d",&n);
    back(1);

    return 0;
}