#include <bits/stdc++.h>
using namespace std;
struct Node {
  int op;
  long long a, b;
};
long long exgcd(long long a, long long b, long long& x, long long& y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long d = exgcd(b, a % b, y, x);
  y -= x * (a / b);
  return d;
}
vector<Node> ans;
void solve(long long x, long long k) {
  for (long long i = 1; i <= k; i <<= 1) ans.push_back({0, x * i, x * i});
  long long y = x, val = 0;
  while (k) {
    if (k & 1) {
      ans.push_back({0, val, y});
      val += y;
    }
    y <<= 1;
    k >>= 1;
  }
}
int main() {
  long long x;
  scanf("%lld", &x);
  ans.push_back({1, x, x});
  long long k = 1;
  while (k <= x) k <<= 1;
  k >>= 1;
  solve(x, k);
  long long y = x * k;
  ans.push_back({1, x, y});
  y ^= x;
  long long a, b;
  exgcd(x, y, a, b);
  a = abs(a);
  b = abs(b);
  solve(x, a);
  solve(y, b);
  long long p = x * a, q = y * b;
  if ((p ^ q) != 1) {
    ans.push_back({0, p, x});
    ans.push_back({0, q, x});
    p += x;
    q += x;
  }
  ans.push_back({1, p, q});
  printf("%d\n", ans.size());
  for (auto u : ans) {
    printf("%lld", u.a);
    if (u.op == 0)
      printf(" + ");
    else
      printf(" ^ ");
    printf("%lld\n", u.b);
  }
  return 0;
}
