#include <iostream>
using namespace std;
int a[100],n,cnt;
bool b[100];
 
void dfs(int dep){
    if(dep > n){
        for(int i = 1;i <= n;i++){
            printf("%d", a[i]);
        }
        cnt++;
        putchar('\n');
        putchar('\n');
        return;
    }
    for(int i = 1;i <= n;i++){
        if(b[i] == false){
            a[dep] = i;
            b[i] = true;
            dfs(dep+1);
            b[i] = false;
        }
    }
}
 
int main(){
    scanf("%d", &n);
    dfs(1);
    printf("%d\n", cnt);
    return 0;
}