#include <iostream>
#include <fstream>
#include <algorithm>
#include <cmath>

#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <deque>
#include <queue>
#include <stack>

using namespace std;

ifstream fin("permutari.in");
ofstream fout("permutari.out");

typedef long long ll;

int n;
vector<int> v;
vector<bool> visited;

void bkt(int k) {
    if (k == n) {
        for (int i = 0; i < n; ++i) {
            fout << v[i] << ' ';
        }
        fout << '\n';
    }
    else {
        for (int i = 1; i <= n; ++i) {
            if (!visited[i]) {
                v[k] = i;
                visited[i] = 1;
                bkt(k + 1);
                visited[i] = 0;
            }
        }
    }
}

void Solve() {
    fin >> n;
    v.resize(n);
    visited.resize(n + 1);

    bkt(0);
}

int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    Solve();

    return 0;
}