#include <iostream>
#include <fstream>
#include <algorithm>
#include <math.h>
#include <string>
#include <vector>
#include  <stdio.h>
#define LL long long
using namespace std;
int n;
vector<int> a;
ofstream f;
ifstream g;

int main()
{
    f.open("permutari.out");
    g.open("permutari.in");
    g>>n;
    for (int i=1; i<=n; i++)
    {
        a.push_back(i);
        f<<i<<' ';
    }
    f<<'\n';
    while (next_permutation(a.begin(),a.end()))
    {
        for (int i=0; i<n; i++)
            f<<a[i]<<' ';
        f<<'\n';
    }
    return 0;
}