#include <iostream> #include <cstring> #include <iomanip> using namespace std; int n, res[110], vis[110], cnt = 0; void dfs(int cur){ if(cur == n + 1){ for(int i = 1; i <= n; i++){ cout << res[i]; } cout << endl; cnt++; return ; } for(int i = 1; i <= n; i++){ if(!vis[i]){ res[cur] = i; vis[i] = 1; dfs(cur + 1); vis[i] = 0; } } } int main(){ cin >> n; dfs(1); cout << cnt; return 0; }