import sys
#sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10**9 + 7
MOD2 = 998244353
from collections import defaultdict
def ceil(A,B):
    return -(-A//B)
def solve():
    def II(): return int(sys.stdin.readline())
    def LI(): return list(map(int, sys.stdin.readline().split()))
    def LC(): return list(sys.stdin.readline().rstrip())
    def IC(): return [int(c) for c in sys.stdin.readline().rstrip()]
    def MI(): return map(int, sys.stdin.readline().split())
    N =II()
    n = N
    Ans = []
    while(N!=1):
        if(N%2==0):
            N//=2
            Ans.append("/")
        else:
            N = 3*N+1
            Ans.append("+")
    Ans2 = []
    while(n!=1 and len(Ans2)<=10000):
        if(n%2==0):
            n//=2
            Ans2.append("/")
        else:
            n=3*n-1
            Ans2.append("-")
    if(n==1 and len(Ans2)<=10000):
        print(len(Ans2))
        print(*Ans2,sep="")
    else:
        print(len(Ans))
        print(*Ans,sep="")
    return
solve()