//Sa se genereze toate permutarile multimii {1, 2, ...N}, in ordine lexicografica.
#include <fstream>
using namespace std;

int uz[10], x[10] ,n;
ofstream fout("permutari.out"); 
void back(int k){
 for(int i =1;i<=n;i++)
	 if(!uz[i]){
	 	uz[i] = 1;
		x[k]=i;
		if(k==n){
			for( int j=1;j<=n;j++)
				fout<<x[j]<<" ";
			fout<<endl;
		}
		else
			back(k+1);
		uz[i] = 0;
	 }
}
int main(){
	ifstream fin("permutari.in"); fin>>n; fin.close();
	back(1);
	fout.close();
	return 0;
}