#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ofstream out("permutari.out");
int a[10];
bool used[10] = {0};
int n;
void recurs(int pos)
{
    int i;
    if(pos == 2)
    {
        a[pos] = n;
        for(i=0;i<=pos;++i)
        {
            if(used[i+1] == 0)
                a[pos] = i+1;
            out << a[i] << " ";
        }
        out << '\n';
    }
    else
    {
        for(i=1;i<=n;++i)
        {
            if(!used[i])
            {
                a[pos] = i;
                used[i] = 1;
                recurs(pos+1);
                used[i] = 0;
            }
        }
    }

}
int main()
{
    int i;
    int act;
    ifstream in("permutari.in");
    in >> n;
    for(i=1;i<=n;++i)
    {
        a[0] = i;
        used[i] = 1;
        recurs(1);
        used[i] = 0;
    }
    return 0;
}