// Matteo Verzotti - C++
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <ctime>
#include <map>
#include <chrono>
#include <cmath>
#define INF 0x3f3f3f3f
#define MAX(a,b) a>b ? a:b
#define MIN(a,b) a<b ? a:b

using namespace std;

/*mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

long long rand_seed() {
    long long a = rng();
    return a;
}*/

vector <int> v;

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