#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iterator>
#include <random>
#include <assert.h>
using namespace std;

const string file = "permutari";

const string infile = file + ".in";
const string outfile = file + ".out";

const int INF = 0x3f3f3f3f; 

//#define ONLINE_JUDGE

bool nextPerm(vector<int>& A, int N)
{

    int x = N - 2;
    while(x >= 0)
    {
        if(A[x] < A[x+1])
            break;
        x--;
    }
    if(x < 0)
    {
        return false;
    }
    
    int y = N - 1;
    while(A[x] > A[y])
    {
        y--;
    }
    swap(A[x], A[y]);
    reverse(A.begin() + x + 1, A.end());

    return true;
}

int main()
{
#ifdef ONLINE_JUDGE
	ostream &fout = cout;
	istream &fin = cin;
#else
	fstream fin(infile.c_str(), ios::in);
	fstream fout(outfile.c_str(), ios::out);
#endif	

    int N;
    fin >> N;
    vector<int> A(N);
    for(int i = 0; i < N; i++)
    {
        A[i] = i + 1;
    }

    do
    {
        for(int i = 0; i < N; i++)
        {
            fout << A[i] << " ";
        }
        fout << "\n";
    }
    while(nextPerm(A, N));


#ifdef ONLINE_JUDGE
#else
    fout.close();
	fin.close();
#endif
}