#include <bits/stdc++.h>
using namespace std;
#define ll                 long long 
#define all(v)             v.begin(), v.end()
ll ceil2(ll a, ll b) {
return (a + b - 1) / b;
}
// #include <ext/pb_ds/assoc_container.hpp> 
// #include <ext/pb_ds/tree_policy.hpp> 
// using namespace __gnu_pbds; 
// #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 

#define mod 1000000001;



void solve(){
    ll n;cin>>n;
    vector<ll> v;
    for(int i=1; i<=n; i++){
        v.push_back(i);
        cout<<i<<" ";
    }
    cout<<'\n';
    
    while(next_permutation(v.begin(), v.end())){
        for(int i=0; i<n; i++){
            cout<<v[i]<<" ";
        }
        cout<<"\n";
    }
}


int main(){
    freopen("permutari.in", "rt", stdin);
	freopen("permutari.out", "wt", stdout);
   ios_base::sync_with_stdio(false); cin.tie(NULL);
//    ll t;cin>>t;while(t--){solve();cout<<endl;}
    solve();
}