#include<bits/stdc++.h> using namespace std; int a[10],b[10],n,sum=0; void dfs(int t){ if(t-1==n){ for(int i=1;i<=n;i++){ cout<<a[i]; } sum++; cout<<endl; return ; } for(int i=1;i<=n;i++){ if(b[i]==1){ a[t]=i; b[i]=0; dfs(t+1); b[i]=1; } } } int main(){ freopen("permutation.in","r",stdin); freopen("permutation.out","w",stdout); for(int i=0;i<10;i++){ b[i]=1; } cin>>n; dfs(1); //cout<<sum; return 0; }