#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
#define maxn 200010
#define nmaxn 2000000010

int k,n,s[100];
bool ok;

ifstream in ("permutari.in");
ofstream out("permutari.out");
void backtrack (int k)
{
    if(k==n)
    {
        for(int i=1;i<=n;i++)
        out<<s[i]<<" ";
        out<<"\n";
    }
    else
    {
        for(int i=1;i<=n;i++)
            {ok=true;
            for(int j=1;j<=k;j++)
                if(s[j]==i)
            {
                ok=false;
                break;
            }
            if(ok==true)
            {
                s[k+1]=i;
                backtrack(k+1);
            }
            }
    }
}
int main(){
    in>>n;
    backtrack(0);

}






//'\n'
// ||