#include <bits/stdc++.h>

using namespace std;
ifstream in ("permutari.in");
ofstream out ("permutari.out");
int x[20];
void afis(int x[], int n)
{
    for(int i = 1; i <= n; i ++)
        out << x[i] << " ";
    out << "\n";
}
bool valid (int i)
{
    for(int j = 1; j <= i - 1; j ++)
        if(x[i] ==  x[j]) return 0;
    return 1;
}
int main()
{
    int i, n;
    in >> n;
    i = 1;
    while(i > 0)
    {
        x[i] ++;
        if(x[i] > n)
        {
            x[i] = 0;
            i --;
        }
        else if(valid(i) == 1)
        {
            if (i == n)
                afis(x, n);
            else i ++;
        }
    }
    return 0;
}