#include<cstdio>
#define maxn 10

using namespace std;
int viz[maxn], sol[maxn];
int n;
void read()
{
	freopen("permutari.in","r",stdin);
	freopen("permutari.out","w",stdout);
	
	scanf("%d",&n);
	
}

void write(int n)
{
	for (int i=1;i<=n;++i)
		printf("%d ",sol[i]);
	printf("\n");
}

void bkt(int k,int n)
{
    if (k==n)
        {
                 write(n);
                 return;
        }
    else
    {
        for (int i=1;i<=n;i++)
            if (!viz[i])
                {
                    sol[k+1]=i;
                    viz[i]=1;
                    bkt(k+1,n);
                    viz[i]=0;
                }
    }
}



void solve()
{
	
	bkt(0,n);

}


int main()
{
	read();
	solve();
	
}