// #pragma GCC target("avx")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>

template<typename T>
void chmax(T &a, const T &b) {a = (a > b? a : b);}
template<typename T>
void chmin(T &a, const T &b) {a = (a < b? a : b);}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = 1e18;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};

#define int long long

void solve() {
    int n;
    cin >> n;

    map<int, int> dist, pre;
    map<int, bool> done;
    queue<int> que;
    que.push(n);
    dist[n] = 0;
    done[n] = true;

    while(!que.empty()) {
        int v = que.front();
        que.pop();

        if(v%2==0) {
            if(!done[v/2]) {
                pre[v/2] = v;
                dist[v/2] = dist[v]+1;
                done[v/2] = true;
                que.push(v/2);

                if(v/2 == 1) break;
            }
        }else {
            if(3*v+1 <= INF && !done[3*v+1]) {
                pre[3*v+1] = v;
                dist[3*v+1] = dist[v]+1;
                done[3*v+1] = true;
                que.push(3*v+1);
            }
            if(3*v-1 <= INF && !done[3*v-1]) {
                pre[3*v-1] = v;
                dist[3*v-1] = dist[v]+1;
                done[3*v-1] = true;
                que.push(3*v-1);
            }
        }
    }

    int now = 1;
    string ans;
    while(now != n) {
        int before = pre[now];
        if(before%2==0) ans.push_back('/');
        else if(3*before+1 == now) ans.push_back('+');
        else {
            assert(3*before-1 == now);
            ans.push_back('-');
        }
        now = before;
    }

    reverse(all(ans));
    cout << (int)ans.size() << endl;
    cout << ans << endl;

    // int cur = n;
    // FOR(ans.size()) {
    //     if(ans[i] == '/') {
    //         assert(cur%2==0);
    //         cur /= 2;
    //     }else if(ans[i] == '+') {
    //         cur = 3*cur+1;
    //     }else {
    //         cur = 3*cur-1;
    //     }
    //     assert(cur <= INF);
    // }
    // assert(cur==1);
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}