#include <cstdio>
using namespace std;
int sol[11], n, nr=0;
bool sel[11];
void afis ()
{
    for (int i=1; i<=n; i++) printf("%d ",sol[i]); printf("\n");
}
void back (int k)
{
    if (k>n) afis();
    else
    {
        for (int i=1; i<=n; i++)
        {
            if (!sel[i])
            {
                sel[i]=true; sol[++nr]=i;
                back(k+1); nr--; sel[i]=false;
            }
        }
    }
}
int main()
{
    freopen("permutari.in","r",stdin);
    freopen("permutari.out","w",stdout);
    scanf("%d",&n);
    back(1);
    return 0;
}