#include <bits/stdc++.h>

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

int n;
int st[10], top;
int viz[10];

void Back(int top)
{
    if (top == n + 1)
    {
        for (int i = 1; i <= n; i++)
            fout << st[i] << " ";
        fout << "\n";
    }
    for (int i = 1; i <= n; i++)
        if (!viz[i])
        {
            viz[i] = 1;
            st[top] = i;
            Back(top + 1);
            viz[i] = 0;
        }
}

int main()
{
    fin >> n;
    Back(1);
    return 0;
}