/*#include <bits/stdc++.h>

using namespace std;

int main(){
    ifstream f("permutari.in");
    ofstream g("permutari.out");
    int n;
    vector<int> a;
    f>>n;
    for(int i=1; i<=n; ++i)
        a.push_back(i);
    do{
        for(int i=0; i<n; ++i) g<<a[i]<<" ";
        g<<endl;
    } while (next_permutation(a.begin(), a.end()));
}
*/
#include <bits/stdc++.h>

using namespace std;

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

int v[20];
int n,m;

bool is_safe(int v[],int x)
{
    for (int i=1;i<=n;++i)
    {
        if (x==v[i]) return false;
    }
    return true;
}

void comb(int k)
{
    if (k==n+1)
    {
        for (int i=1;i<=n;++i)
        {
            g<<v[i]<<" ";
        }
        g<<'\n';
    }
    else
    {
        for (int i=1;i<=n;++i)
        {
            if (is_safe(v,i))
            {
                v[k]=i;
                comb(k+1);
                v[k]=0;
            }
        }
    }
}

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