#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(int lastIndex, vector<int> numbers) {
    if (lastIndex == n) {
        for (auto item : numbers) {
            fout << item << " ";
        }
        fout << "\n";
        return;
    }

    for (int i = lastIndex; i < n; ++i) {
        swap(numbers[lastIndex], numbers[i]);
        backtracking(lastIndex + 1, numbers);
        swap(numbers[lastIndex], numbers[i]);
    }
}

int main() {
    fin >> n;

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

    backtracking(0, numbers);
    return 0;
}