#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>

using namespace std;

const int nmax = 10;

int n, i, a[nmax];

int main()
{
    freopen("permutari.in", "r", stdin);
    freopen("permutari.out", "w", stdout);

    scanf("%d", &n);

    for(i = 1; i <= n; i++)
        a[i] = i;

    do
    {
        for(i = 1; i <= n; i++)
            printf("%d ", a[i]);
        printf("\n");
    }
    while(next_permutation(a + 1, a + n + 1));

    return 0;
}