#include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; typedef unsigned long long ull; typedef pair P; typedef pair> PP; const ll MOD = 1e9 + 7; const ll MOD2 = 998244353; const ll INF = 1 << 30; const ll INF2 = 9e18; const double INF3 = 9e14; const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; const int tx[8] = { -1,0,1,-1,1,-1,0,1 }, ty[8] = { -1,-1,-1,0,0,1,1,1 }; #define ALL(x) (x).begin(),(x).end() #define pb push_back #define fr first #define sc second int main(){ int n; cin >> n; cout << 'a' << endl; if (n == 1)return 0; vectorv = { 1,2,3,4,5,6,7,8,9,10 }; for (int i = 1;i < n;i++) { string t = "a"; for (auto u : v) { t += char('a' + u); } if (i != n)cout << t + 'a' << endl; else cout << t + 'n' << endl; next_permutation(ALL(v)); } return 0; }