#include <iostream>
#include <fstream>

using namespace std;

ifstream f("permutari.in");
ofstream g("permutari.out");

int n,s[10];

void back(int k)
{
    if(k==n)
    {
        for (int i = 1; i <= n; ++i)
            g<<s[i]<<' ';
        g<<'\n';
    } else
    {
        for (int i = 1; i <= n; ++i) {
            bool ok=true;
            for (int j = 1; j <=k ; ++j)
                if(s[j]==i)
                {
                    ok=false;
                    break;
                }
            if(ok)
            {
                s[k+1]=i;
                back(k+1);
            }
        }
    }
}

int main() {
    f>>n;
    back(0);
    return 0;
}