#include<bits/stdc++.h> using namespace std; int res[105],cnt[105],cnt; bool vis[105]; void dfs(int cur,int n){ if (cur > n){ for (int i = 1;i <= n;i++){ cout<<res[i]; } cout<<endl; cnt++; return ; } for (int i = 1;i <= n;i++){ if (vis[i] == false){ vis[i] = true; res[cur] = i; dfs(cur + 1,n); vis[i] = false; } } } int main(){ int n; scanf("%d",&n); dfs(1,n); printf("%d",cnt); return 0; }