#include <bits/stdc++.h>
using namespace std;
struct Op {
  long long x, y;
  char t;
  Op(long long x, long long y, char t) : x(x), y(y), t(t) {}
};
vector<Op> ans;
long long mul(long long x, long long k) {
  long long res = 0;
  while (k != 0) {
    if (k & 1) {
      ans.push_back({res, x, '+'});
      res += x;
    }
    ans.push_back({x, x, '+'});
    x += x;
    k >>= 1;
  }
  return res;
}
long long gcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1, y = 0;
    return a;
  }
  long long x1, y1;
  long long g = gcd(b, a % b, x1, y1);
  x = y1;
  y = x1 - (a / b) * y1;
  return g;
}
void solve() {
  long long x;
  cin >> x;
  ans.push_back({x, x, 2});
  long long k = 1;
  while (k * 2 <= x) k *= 2;
  long long y = mul(x, k);
  ans.push_back({y, x, '^'});
  y ^= x;
  long long k1, k2;
  long long g = gcd(x, y, k1, k2);
  long long x1 = mul(x, abs(k1));
  long long y1 = mul(y, abs(k2));
  if ((x1 ^ y1) != 1) {
    ans.push_back({x1, x, '+'});
    x1 += x;
    ans.push_back({y1, x, '+'});
    y1 += x;
  }
  ans.push_back({x1, y1, '^'});
  cout << ans.size() << "\n";
  for (Op &op : ans) {
    cout << op.x << (op.t == '+' ? " + " : " ^ ") << op.y << "\n";
  }
}
int main() {
  int tests = 1;
  while (tests--) {
    solve();
  }
  return 0;
}
