#include <stdio.h>
#include <cstring>
#include <stdlib.h>
#include <time.h>
#include <bitset>
#include <string>
#include <vector>
#include <math.h>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <limits.h>
#include <algorithm>
#include <deque>
#define nmax 2000010
#define inf 0x3f3f3f3f
using namespace std;
int n,i,nr,j,t[10];
bitset <nmax> fr;
int main(){
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
for (i=0;i<n;i++) t[i]=i+1;
do{
    for (i=0;i<n;i++) printf("%d ",t[i]);
    printf("\n");
}while (next_permutation(t,t+3));
return 0;
}