#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <cstring>
#include <stack>

using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");

#define ll long long
#define pb push_back
const int NMax = 1e1 + 5;

int N;
bool vis[NMax];
int v[NMax];

void backT(int idx) {
    if (idx == N+1) {
        for (int i=1;i <= N;++i) {
            out<<v[i]<<' ';
        }
        out<<'\n';

        return;
    }

    for (int i=1;i <= N;++i) {
        if (vis[i]) {
            continue;
        }

        v[idx] = i;
        vis[i] = true;
        backT(idx+1);
        vis[i] = false;
    }
}

int main() {
    in>>N;
    backT(1);

    in.close();out.close();
    return 0;
}