#include <iostream>
#include <vector>
#include <map>
#include <cstring>
#include <fstream>
#include <sstream>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
#include <unordered_map>
#include <stack>
#include <iomanip>
#include <random>
#include <climits>

using namespace std;

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

int n;

void backtracking(vector<int> &numbers, vector<bool> &used, vector<int> &currentPerm) {
    if (currentPerm.size() == n) {
        for (auto item : currentPerm) {
            fout << item << " ";
        }
        fout << "\n";
        return;
    }

    for (int i = 0; i < n; ++i) {
        if (!used[i]) {
            used[i] = true;
            currentPerm.push_back(numbers[i]);
            backtracking(numbers, used, currentPerm);
            currentPerm.pop_back();
            used[i] = false;
        }
    }
}

int main() {
    fin >> n;

    vector<int> numbers;
    for (int i = 1; i <= n; ++i) {
        numbers.push_back(i);
    }

    vector<bool> used(n, false);
    vector<int> currentPerm;

    backtracking(numbers, used, currentPerm);
    return 0;
}