#include <bits/stdc++.h>
using namespace std;
template <class T>
void print(T& x) {
  cout << x;
}
template <class T, class U>
void print(pair<T, U>& p) {
  cout << "(";
  print(p.first);
  cout << ", ";
  print(p.second);
  cout << ")";
}
template <class T>
void print(vector<T>& v) {
  cout << "{";
  if (((int)(v).size())) print(v[0]);
  for (int i = 1; i < ((int)(v).size()); i++) cout << ", ", print(v[i]);
  cout << "}\n";
}
vector<long long> X;
vector<tuple<int, long long, long long>> Q;
long long add(long long x) {
  for (long long z : X) {
    if ((z ^ x) < x) {
      Q.emplace_back(1, x, z);
      x = min(x, (z ^ x));
    }
  }
  if (x > 0 && x < 1e17) {
    for (int i = 0; i < ((int)(X).size()); i++) {
      if (X[i] > (X[i] ^ x)) {
        Q.emplace_back(1, X[i], x);
        X[i] = min(X[i], X[i] ^ x);
      }
    }
    X.push_back(x);
  } else
    x = 0;
  return x;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long x;
  cin >> x;
  queue<long long> q;
  q.push(x);
  while (((int)(q).size())) {
    long long res = q.front();
    q.pop();
    res = add(res);
    if (res) {
      for (long long k : X) {
        Q.emplace_back(0, k, res);
        q.push(k + res);
      }
    }
    if (res == 1) {
      break;
    }
  }
  cout << ((int)(Q).size()) << endl;
  for (auto [t, a, b] : Q) {
    cout << a;
    if (t == 0) {
      cout << " + ";
    } else
      cout << " ^ ";
    cout << b << "\n";
  }
}
