#include <fstream>
using namespace std;


int x[20];
int v[20];

int n, i;

ofstream fout("permutari.out");

void back(int k) {

    if (k > n) { // nr de nivele > lungimea solutiei, tiparesc o solutie
        for (int i=1;i<=n;i++)
            fout<<x[i]<<" ";
        fout<<"\n";


    } else {
        for (int i=1;i<=n;i++) {  // pun toate valorilep[osibile la nivelul curent
            if (v[i] == 0) {
                x[k] = i;

                v[i] = 1;
                back(k+1);
                v[i] = 0;
            }
        }


    }

}


int main() {
    ifstream fin("permutari.in");
    fin>>n;
    back(1);

    return 0;
}
/*
0 0 0
0 0 1
0 0 2

0 0 58
0 0 59
0 1 0
0 1 1
0 1 2

0 1 59
0 2 0

0 59 59
1 0 0
*/