sinh hoan vi

#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;

int gt(int n){
    int s=1;
    for(int i=2;i<=n;i++) s*=i;
    return s;
}
void in(int day[],int n){
    for(int i=0;i<n;i++) cout<<day[i];
    cout<<endl;
}
void next(int day[],int n){
    int vitri=n-2;
    while(day[vitri]>day[vitri+1]) vitri--;
    int p=n-1;
    while(day[p] < day[vitri]) p--;
    swap(day[p],day[vitri]);                    //doi vi tri lam mat quy tac
    sort(&day[vitri+1], &day[n]);               //dao ngc day tu luk doi vi tri
}
int main(){
    int n;
    cin>>n;
    int day[100];
    for(int i=0;i<=n-1;i++){
        day[i]=i+1;
    }
    in(day,n);
    int a=gt(n);
//  cout<<a<<endl;
    for(int i=1;i<a;i++){
        next(day,n);
        in(day,n);
    }
    return 0;
}