#include <bits/stdc++.h>
using namespace std;

#include <ostream>
#include <vector>
namespace combinatorics
{
    #define uint unsigned int
    void permutationsGenerator(uint k, uint n, std::vector<int>&perm, std::vector<bool>&used, std::ostream& out)
    {
        if (k == n)
        {
            for (auto x:perm) out<<x<<' ';
            out<<'\n';
            return;
        }
        for (int i=1;i<=n;++i)
        {
            if (used[i]) continue;
            used[i] = true;
            perm[k] = i;
            permutationsGenerator(k+1, n, perm, used, out);
            used[i] = false;
        }
    }
    bool permutations(uint n, std::ostream& out)
    {
        if (!n) return false;
        std::vector<int>perm;
        std::vector<bool>used;
        perm.resize(n);
        used.resize(n);
        permutationsGenerator(0, n, perm, used, out);
        return true;
    }

    void arrangementsGenerator(uint k, uint n, uint m, std::vector<int>&arr, std::vector<bool>&used,std::ostream& out)
    {
        if (k == m)
        {
            for (auto x:arr) out<<x<<' ';
            out<<'\n';
            return;
        }
        for (int i=1;i<=n;++i)
        {
            if (used[i]) continue;
            used[i] = true;
            arr[k] = i;
            arrangementsGenerator(k+1,n,m,arr,used,out);
            used[i] = false;
        }
    }
    bool arrangements(uint n, uint m, std::ostream& out)
    {
        if (!n) return false;
        std::vector<int>arr;
        std::vector<bool>used;
        arr.resize(n);
        used.resize(n);
        arrangementsGenerator(0, n, m, arr, used, out);
        return true;
    }
}

int main()
{
    freopen("permutari.in","r",stdin);
    freopen("permutari.out","w",stdout);
    int n;
    cin>>n;
    combinatorics::permutations(n, cout);
    return 0;
}