#include <iostream>
#define MAX 1001
#include <cmath>
#include <fstream>

using namespace std;
int v[MAX],n;

ifstream fin("permutari.in");
ofstream fout("permutari.out");

bool valid(int k)
{
    int i;
    for(i=1;i<=k-1;++i)
        if(v[i]==v[k])return false;

     return true;;
}

bool solutie(int k)
{
    if(n==k)return true;
    return false;
}

void afisare(int k){
    int i;
    for(i=1;i<=k;++i)
        fout<<v[i]<<" ";
    fout<<endl;
}
void BK(int k)
{
    int i;
    for(i=1;i<=n;++i)
    {v[k]=i;
    if(valid(k))
        if(solutie(k))afisare(k);
        else BK(k+1);

    }
}
int main()
{
    fin>>n;
    BK(1);
    return 0;
}