#include<iostream>
#include<cstdio>
#include<queue>
#include<vector>
#include<bitset>
#include<algorithm>
#define INF 0x3f3f3f3f
#define mp make_pair
#define pb push_back
#define maxn 10
using namespace std;
int a[maxn],n,i;

int main()
{
    freopen("permutari.in","r",stdin);
    freopen("permutari.out","w",stdout);
    scanf("%d",&n);
    for(i=1; i<=n; ++i)
        a[i]=i;
    do
    {
        for(i=1; i<=n; ++i)
            printf("%d ",a[i]);
        printf("\n");
    }
    while(next_permutation(a+1,a+n+1));
    return 0;
}