def names_combine(n1, n2):
    sol = ''
    imin = min(len(n1), len(n2))
    for i in range(imin):
        sol = sol + max(n1[i], n2[i])
    return sol + n1[imin:] + n2[imin:]

def names_combine(n1, n2):
    sol = ''
    l1, l2 = len(n1), len(n2)
    for i in range(max(l1, l2)):
        if i < l1 and i < l2:
            sol = sol + max(n1[i], n2[i])
        elif i < len(n1):
            sol = sol + n1[i]
        else:
            sol = sol + n2[i]
    return sol