#include <cstdio>
#include <algorithm>
using namespace std;
#define rep(i, from, to) for (int i = from; i < (int)(to); ++i)
#define trav(a, x) for (auto& a : x)

const int N = 10;

int n, a[N];

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