#include <fstream>

using namespace std;

ifstream f ("permutari.in");
ofstream g ("permutari.out");
int v[10] , n;
int verif ( int k )
{
    for ( int i = 1 ; i < k ; ++i)
        if ( v[k] == v[i])
        return 0;
    return 1;
}
void afis()
{
    for ( int i = 1 ; i <= n ; ++i)
        g << v[i] << ' ';
    g << '\n';
}
void vback()
{
    int k = 1;
    v[k] = 0;
    do
    {
        while (v[k] < n)
        {
            v[k]++;
            if ( verif(k))
                if(k == n)
                afis();
            else
            {
                k++;
                v[k] = 0;
            }
        }
        k--;
    }while(k > 0);
}
int main ()
{
    f >> n;
        vback();
            g.close();
        return 0;
}