#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
const long long INF = 1e18;
vector<pair<int, pair<long long, long long> > > ov;
void make(long long x, long long mul) {
  if (mul == 1) return;
  if (mul % 2 == 0) {
    make(x, mul / 2);
    ov.emplace_back(1, pair<long long, long long>(x * mul / 2, x * mul / 2));
  } else {
    make(x, (mul - 1) / 2);
    ov.emplace_back(
        1, pair<long long, long long>(x * (mul - 1) / 2, x * (mul - 1) / 2));
    ov.emplace_back(1, pair<long long, long long>(x * (mul - 1), x));
  }
  return;
}
inline long long reduce(long long x) {
  int p = 0;
  while (x > (1ll << p)) p++;
  long long m1 = 1ll << p;
  long long m2 = m1 - 1;
  make(x, m1);
  make(x, m2);
  ov.emplace_back(2, pair<long long, long long>(x * m1, x * m2));
  ov.emplace_back(1, pair<long long, long long>(m1 + m1 - x, x));
  long long y = x;
  while (y != m1) {
    ov.emplace_back(1, pair<long long, long long>(y, y));
    y *= 2;
    if (y >= m1 + m1) {
      ov.emplace_back(2, pair<long long, long long>(y, m1 + m1));
      y -= m1 + m1;
    }
  }
  ov.emplace_back(2, pair<long long, long long>(m1 + m1 - x, m1));
  return m1 - x;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  long long x;
  cin >> x;
  while (x != 1) x = reduce(x);
  cout << ov.size() << endl;
  for (auto& t : ov) {
    if (t.first == 1)
      cout << t.second.first << " + " << t.second.second << '\n';
    else
      cout << t.second.first << " ^ " << t.second.second << '\n';
  }
  return 0;
}
