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

ifstream cin("permutari.in");
ofstream cout("permutari.out");

int n;
int f[16];
int p[16];

void bkt(int q){
    if(q==n+1){
         for(int i=1;i<=n;i++)cout<<p[i]<<" ";
         cout<<endl;
         return;
    }

    for(int val=1;val<=n;val++){
          if(f[val]==0){
              p[q]=val;
              f[val]=1;
              bkt(q+1);
              f[val]=0;
          }
    }
}


int main()
{
    cin>>n;
    bkt(1);
}