#include<bits/stdc++.h> //:3
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi pair<int, int>
#define sz(x) (int)((x).size())
//#define int long long

const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};

const ll inf = 2e9;
const ll mod = 1e9 + 7;
const int N = 2e6 + 11;
const int X = 1e6;
const ll INF64 = 3e18 + 1;
const double eps = 1e-14;
const double PI = acos(-1);

ifstream in("permutari.in");
ofstream out("permutari.out");

int n, m, ans[N], v[N];

void print(){
    for(int i = 1; i <= n; i++){
        out << v[i] << ' ';
    }out << '\n';
}

int ok(int k){
    for(int i = 1; i < k; i++){
        if(v[i] == v[k])return 0;
    }
    return 1;
}

void bk(int k){
    if(k == n + 1){
        print();
        return;
    }

    for(int i = 1; i <= n; i++){
        v[k] = i;
        if(ok(k))bk(k + 1);
    }
}

void solve(){

    in >> n;

    bk(1);
}

int32_t main(){
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);

    //cout << setprecision(6) << fixed;

    int T = 1;
    //cin >> T;
    while(T--){
        solve();
    }
}