#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  ll n; cin >> n;
  string ans = "";
  set<ll> st{n};
  while (n > 1) {
    if (n % 2 == 0) {
      n /= 2;
      ans += '/';
    } else if (st.contains(n * 3 - 1)) {
      assert(st.emplace(n * 3 + 1).second);
      n = n * 3 + 1;
      ans += '+';
    } else if (st.contains(n * 3 + 1)) {
      assert(st.emplace(n * 3 - 1).second);
      n = n * 3 - 1;
      ans += '-';
    } else {
      ll x = n * 3 - 1, y = n * 3 + 1;
      while (x % 2 == 0) x /= 2;
      while (y % 2 == 0) y /= 2;
      if (x < y) {
        assert(st.emplace(n * 3 - 1).second);
        n = n * 3 - 1;
        ans += '-';
      } else {
        assert(st.emplace(n * 3 + 1).second);
        n = n * 3 + 1;
        ans += '+';
      }
    }
  }
  cout << ans.length() << '\n' << ans << '\n';
  return 0;
}