def divid_by_n(num: int, n: int) -> str:
    """Return base <n> representation of <num>.
    """
    q, r = divmod(num, n)
    stack = []
    stack.append(r)
    while (q > 0):
        q, r = divmod(q, n)
        stack.append(r)

    converted = ""
    while stack != []:
        converted += str(stack.pop())

    return converted