import sys


def dfs(k, current_sum, prev, path, n):
    if k > n:
        if current_sum == 0:
            print(path)
        return

    combined = int(f"{abs(prev)}{k}")
    new_prev = combined if prev >= 0 else -combined
    new_sum = current_sum - prev + new_prev

    dfs(k + 1, new_sum, new_prev, path + " " + str(k), n)
    dfs(k + 1, current_sum + k, k, path + "+" + str(k), n)
    dfs(k + 1, current_sum - k, -k, path + "-" + str(k), n)


def solve(n):
    dfs(2, 1, 1, "1", n)


def main():
    input_data = sys.stdin.read().split()
    if not input_data:
        return

    for item in input_data:
        num = int(item)
        solve(num)


if __name__ == "__main__":
    main()