#include <bits/stdc++.h>
using namespace std;
vector<int> v;
int n,k;


int factorial(int i)
{
    if (i == 1) return 1;
    return i*factorial(i-1);
}

int main()
{
    freopen("permutari.in","r",stdin);
    freopen("permutari.out","w",stdout);
    scanf("%d",&n);
    for (int i = 1; i<=n; ++i)
    {
        v.push_back(i);
        printf("%d ",i);
    }
    printf("\n");
    k = factorial(n);
    for (int i = 2; i<= k; ++i, printf("\n"))
    {
        next_permutation(v.begin(),v.end());
        for (int i = 0; i<n; ++i)
        {
            printf("%d ",v[i]);
        }
    }
}