#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using VS = vector<string>;
using P = pair<ll,ll>;
using VP = vector<P>;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define out(x) cout << x << endl
#define dout(x) cout << fixed << setprecision(10) << x << endl
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(x) (int)(x.size())
#define re0 return 0
#define pcnt __builtin_popcountll
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
constexpr int inf = 1e9;
constexpr ll INF = 1e18;
//using mint = modint1000000007;
using mint = modint998244353;
int di[4] = {1,0,-1,0};
int dj[4] = {0,1,0,-1};

int main(){
    ll n;
    cin >> n;
    string ans;
    bool end = false;
    set<ll> memo;
    auto rec = [&](auto &rec,ll x) -> void {
        if(end) return;
        if(memo.count(x)) return;
        if(x == 1){
            end = true;
            out(sz(ans));
            out(ans);
            return;
        }
        if(x%2 == 0){
            ans += '/';
            rec(rec,x/2);
            ans.pop_back();
        } else {
            if(x*3+1 <= INF){
                ans += '+';
                rec(rec,x*3+1);
                ans.pop_back();
            }
            if(x*3-1 <= INF){
                ans += '-';
                rec(rec,x*3-1);
                ans.pop_back();
            }
        }
        memo.insert(x);
        return;
    };
    rec(rec,n);
}