#include<iostream>
using namespace std;
const int N = 10;
int ways[N];
bool used[N];
int n;
void dfs(int u){
if(u > n){
for(int i = 1; i <= n; ++i)
cout<<ways[i]<<" ";
cout<<endl;
}
for(int i = 1; i <= n; ++i){
if(!used[i]){
ways[u] = i;
used[i] = true;
dfs(u + 1);
used[i] = false;
}
}
}
int main(){
cin >> n;
dfs(1);
return 0;
}