#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
const int mn = 52 + 10;
const long long inf = 0x3f3f3f3f3f3f3f3f;
const long long mod = 1e9 + 7;
const long long half = (mod + 1) / 2;
const double PI = acos(-1);
vector<string> v;
void ad(long long a, long long b) {
  v.push_back(to_string(a) + " + " + to_string(b));
}
void xo(long long a, long long b) {
  v.push_back(to_string(a) + " ^ " + to_string(b));
}
void solve(long long x) {
  long long lp = 1LL << __builtin_ctz(x);
  if (x == lp) return;
  int a = 0, b = 0;
  for (int i = 0; i < 20; i++)
    if ((x >> i) & 1) {
      b = a;
      a = i;
    }
  int d = a - b;
  for (int i = 0; i < d; i++) ad(x << i, x << i);
  long long xd = x << d;
  xo(xd, x);
  long long cs = (x << d) ^ x;
  ad(cs, x), ad(cs, x << 1), ad(xd, x), ad(xd, x << 1);
  long long csp = cs + x, cspp = cs + x * 2;
  long long xdp = xd + x, xdpp = xd + x * 2;
  xo(csp, xd);
  xo(csp, xdp);
  xo(cspp, xd);
  xo(cspp, xdp);
  xo(cspp, xdpp);
  long long nx = min({csp ^ xd, csp ^ xdp, cspp ^ xd, cspp ^ xdp, cspp ^ xdpp});
  solve(nx);
  long long pp = 1LL << __builtin_ctz(nx);
  if (pp == lp) return;
  for (long long i = pp; x > i; i <<= 1) {
    if (x & i) {
      xo(x, i);
      x ^= i;
    }
    ad(i, i);
  }
  if (x != lp) solve(x);
}
int main() {
  cin.tie(0);
  cin.sync_with_stdio(0);
  long long x;
  cin >> x;
  solve(x);
  printf("%d\n", v.size());
  for (string s : v) printf("%s\n", s.c_str());
}
