#include <fstream>
#include <algorithm>

using namespace std;
ofstream fout("permutari.out");
ifstream fin("permutari.in");
int factorial(int n)
{
  return (n == 1 || n == 0) ? 1 : factorial(n - 1) * n;
}

int main() {
    int v[10];
    int N;
    fin >> N;
    for(int i=1;i<=N;i++) {
        v[i-1]=i;
    }
    
    for(int i=0;i<factorial(N);i++) {
        for(int i=0;i<N;i++) {
            fout << v[i] << " ";
        }
        fout << "\n";
        next_permutation(v, v+N);
    }
    
    
}