#include <cstdio>
#include <algorithm>
#include <vector>

using namespace std;

int N,i,j,F=1;
vector < int > A;

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

scanf("%d",&N);

for (i=1;i<=N;++i)
{
    F*=i;
    A.push_back(i);
}

for (i=1;i<=N;++i) printf("%d ",i);
printf("\n");

for (i=1;i<=F-1;++i)
{
    next_permutation(A.begin(),A.end());
    for (j=0;j<N;++j) printf("%d ",A[j]);
    printf("\n");
}

return 0;
}