#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
#include <list>
#include <map>
#include <math.h>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int main() {
    int n;
    f>>n;
    vector<int> v;
    for(int i=1;i<=n;i++)
    {
        v.push_back(i);
    }
    do
    {
        for(int i=0;i<v.size();i++)g<<v[i]<<" ";
        g<<endl;
    }while(next_permutation(v.begin(), v.end()));
    return 0;
}