#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    vector<int> v;
    int n;
    cin >> n;
    for (int i=1; i<=n; i++){   
        v.push_back(i);
    }

    do{
        for (auto p=v.begin(); p!=v.end(); p++){
            cout << *p << ' ';
        }
        cout << endl;
    }while(next_permutation(v.begin(), v.end()));   //必须保证vector中的元素是升序排列，否则无法按照字典序生成相应的下一个排列
        
    return 0;
}