# Return a list that is the reverse
# list order of input lst
def rev_iter(lst) :
    result = []
    for i in range(0, len(lst)):
        result = lst[i] + result
    return result

# Return a list that is the reverse
# list order of input lst (recursively)
def rev_rec(lst) :
    if lst == [] :
        return []
    else :
        head = lst[0]
        tail = lst[1:]
        smaller_result = rev_rec(tail)
        return smaller_result + [head]