#include <iostream>
#include <fstream>
using namespace std;

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

int N , sol [9];

int Valid (int k )
{
    int i;
    for ( i = 1 ; i < k ; ++ i )
            if ( sol[i] == sol [k] )
                    return 0;
    return 1;
}
void Afisare ()
{
    int i;
    for ( i = 1 ; i <= N ; ++ i)
         fout << sol [i] << " ";
    fout<<"\n";
}

void Back ( int k )
{
    int i;
    for ( i = 1 ; i <= N ; ++ i )
    {
      sol [k] = i ;
      if ( Valid(k) )
         {
              if (k == N )
              Afisare();
          else
              Back (k+1);
         }
    }
}

/*
int main()
{
    fin >> N;
    int i ;
    for ( i = 0 ; i < N ; ++ i )
          sol[i] = i+1 ;
    do
    {
        for ( i = 0 ; i < N ; ++ i )
             fout<<sol[i]<<" " ;
        fout<<endl ;
    }
    while (next_permutation(sol,sol+N)); // se include algorithm
    return 0;
}
*/
int main()
{
    fin >> N;
    Back (1);
    return 0;
}