import sys
sys.setrecursionlimit(5010)

def f(n, s):
    if n==0:
        return
    if s[0]!=s[1]:
        new = s[1]+s[1]+s[2:]
        print(new)
        f(n-1, new)
        return
    if s[2]!=s[3]:
        new = s[:2]+s[3]+s[3]+s[4:]
        print(new)
        f(n-1, new)
        return
    if s[4]!=s[5]:
        new = s[:4]+s[5]+s[5]
        print(new)
        f(n-1, new)
        return
    
    inv1 = ((ord(s[3])-ord('a'))%2)==1
    inv2 = ((ord(s[1])-ord('a'))%2)==1
    # print(inv2)
    if s[5]!=('a' if inv1 else 'z'):
        new = s[:5]+chr(ord(s[5])+(-1 if inv1 else 1))
        print(new)
        f(n-1, new)
        return
    if s[3]!=('a' if inv2 else 'z'):
        new = s[:3]+chr(ord(s[3])+(-1 if inv2 else 1))+s[4:]
        print(new)
        f(n-1, new)
        return
    new = s[0]+chr(ord(s[1])+1)+s[2:]
    print(new)
    f(n-1, new)

    # if (ord(s[5])-ord('a'))%2==1: invert = True

    # for i in range(0, 4):
    #     if s[i]!=s[i+1]:
    #         new = s[:i+1]+s[i]+s[i+2:]
    #         print(new)
    #         f(n-1, new)
    #         return
    
    # if ('a' if invert else 'z')==s[0]:
    #     new = s[:5]+chr(ord(s[5])+1)+s[6:]
    #     print(new)
    #     f(n-1, new)
    # else:
    #     new = chr((ord(s[0])-ord('a')+(-1 if invert else 1))%26+ord('a'))+s[1:]
    #     print(new)
    #     f(n-1, new)
        

n = int(input())

f(n, 'aaaaaa')