#include <cstdio>
using namespace std;
const int NMAX = 15;
int n, a[NMAX];
bool b[NMAX];
void bckt(int nr)
{
    if(nr == n + 1) {
        for(int i = 1;i <= n; ++i) {
            printf("%d  ", a[i]);
        }
        printf("\n");
    }
    else {
        for(int i = 1;i <= n; ++i) {
            if(!b[i]) {
                a[nr] = i;
                b[i] = 1;
                bckt(nr + 1);
                b[i] = 0;
            }
        }
    }
}

int main()
{
    freopen("permutari.in","r",stdin);
    freopen("permutari.out","w",stdout);
    scanf("%d", &n);
    bckt(1);
    return 0;
}