#include <fstream>
#include <iostream>
#include <vector>
#include <bitset>
#include <string.h>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <time.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <deque>

using namespace std;

const char infile[] = "permutari.in";
const char outfile[] = "permutari.out";

ifstream fin(infile);
ofstream fout(outfile);

const int MAXN = 10;
const int oo = 0x3f3f3f3f;

typedef vector<int> Graph[MAXN];
typedef vector<int> :: iterator It;

const inline int min(const int &a, const int &b) { if( a > b ) return b;   return a; }
const inline int max(const int &a, const int &b) { if( a < b ) return b;   return a; }
const inline void Get_min(int &a, const int b)    { if( a > b ) a = b; }
const inline void Get_max(int &a, const int b)    { if( a < b ) a = b; }

int N, K;
bitset <MAXN> Used;
int st[MAXN];

void Back(int N, int K) {
    if(K == N + 1) {
        for(int i = 1 ; i <= N ; ++ i)
            fout << st[i] << ' ';
        fout << '\n';
        return;
    }
    for(int i = 1 ; i <= N ; ++ i)
        if(!Used[i]) {
            st[K] = i;
            Used[i] = 1;
            Back(N, K + 1);
            Used[i] = 0;
        }
}

int main() {
    cin.sync_with_stdio(false);
    #ifndef ONLINE_JUDGE
    freopen(infile, "r", stdin);
    freopen(outfile, "w", stdout);
    #endif
    fin >> N;
    Back(N, 1);
    fin.close();
    fout.close();
    return 0;
}