#include <bits/stdc++.h>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");

int n, fr[10], st[10];

void Afis(int n)
{
    int i;
    for (i = 1 ; i <= n ; i++)
        fout << st[i] << " ";
    fout << "\n";
}

void Back(int top)
{
    int i;
    if (top == n + 1)
        Afis(n);
    else for (i = 1 ; i <= n ; i++)
        if (fr[i] == 0)
    {
        fr[i] = 1;
        st[top] = i;
        Back(top + 1);
        fr[i] = 0;
    }
}

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