#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;

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

vector<vector<int>> generate_all_permutations(int n)
{
    vector<vector<int>> result;
    int a[n];
    for (int i = 0; i < n; ++i)
    {
        a[i] = i + 1;
    }
    do
    {
        vector<int> sol;
        for (int i = 0; i < n; ++i)
        {
            sol.push_back(a[i]);
        }
        result.push_back(sol);
    } while (next_permutation(a, a + n));
    return result;
}

int main()
{
    int n;
    fin >> n;
    vector<vector<int>> permutations = generate_all_permutations(n);
    for (int i = 0; i < permutations.size(); ++i)
    {
        for (int j = 0; j < permutations[i].size(); ++j)
        {
            fout << permutations[i][j] << " ";
        }
        fout << "\n";
    }
    return 0;
}