#include <fstream>
#include <vector>
#include <map>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <set>
using namespace std;
ifstream cin("permutari.in");
ofstream cout("permutari.out");
#define ll long long
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
ll n;
vector<short int> a;
bool fr[10];
void afisare()
{
    for(int i = 0; i < a.size(); i++)
        cout<<a[i]<<" ";
    cout<<'\n';
}
void bkt(int pas)
{
    if(pas == n)
        {afisare(); return;}
    for(int i = 1; i <= n; i++)
    {
        if(fr[i] == 0)
        {
            fr[i] = 1;
            a.push_back(i);
            bkt(pas + 1);
            fr[i] = 0;
            a.pop_back();
        }
    }
}
int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ///ll t; cin>>t; while(t--) solve(), cout<<'\n';
    cin>>n;
    bkt(0);
    return 0;
}