// #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;

    // int pre_n = n;
    
    string ans;
    while(n != 1) {
        if(n%2==0) {
            ans.push_back('/');
            n /= 2;
        }else if(n%4==1) {
            ans.push_back('+');
            n = 3*n+1;
        }else {
            ans.push_back('-');
            n = 3*n-1;
        }
    }

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

    // n = pre_n;
    // for(char c : ans) {
    //     if(c == '/') {
    //         assert(n%2==0);
    //         n /= 2;
    //     }
    //     if(c == '+') {
    //         n = 3*n+1;
    //     }
    //     if(c == '-') {
    //         n = 3*n-1;
    //     }
    //     assert(n <= INF);
    // }
    // assert(n == 1);
}

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