#include<bits/stdc++.h>

#define all(s) s.begin(),s.end()
#define rc(x) return cout<<x<<endl,0
#define forn(i,n) for(int i=0;i<int(n);i++)
#define len(a) (int) (a).size()

#define pb push_back
#define mp make_pair
#define fr first
#define sc second

typedef long long ll;
typedef long double ld;

const int nmax=1e5+3;
const int mod=998244353;
const ll inf=0x3f3f3f3f3f3f3f3f;

/*===================*\
      comentarii:
\*===================*/

using namespace std;

int v[10],f[10];
int n;

void afisare()
{
    for(int i=1;i<=n;i++) cout<<v[i]<<" ";
    cout<<"\n";
}

void back(int k)
{
    if(k>n) afisare(); else
    {
        for(int i=1;i<=n;i++)
            if(!f[i])
        {
            v[k]=i;
            f[i]=1;
            back(k+1);
            f[i]=0;
        }
    }
}

int main()
{
    //freopen("bfs.in","r",stdin);
    //freopen("bfs.out","w",stdout);
    ifstream cin("permutari.in");
    ofstream cout("permutari.out");
    cin>>n;
    back(1);
}