#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

template<class T> bool ckmin(T& a, const T& b) { 
	return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
	return a < b ? a = b, 1 : 0; } 
constexpr int pct(int x) { return __builtin_popcount(x); } 
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
ll half(ll x) { return fdiv(x,2); }

template<class T, class U> T fstTrue(T lo, T hi, U f) { 
	// note: if (lo+hi)/2 is used instead of half(lo+hi) then this will loop infinitely when lo=hi
	hi ++; assert(lo <= hi); // assuming f is increasing
	while (lo < hi) { // find first index such that f is true 
		T mid = half(lo+hi);
		f(mid) ? hi = mid : lo = mid+1; 
	} 
	return lo;
}
template<class T, class U> T lstTrue(T lo, T hi, U f) {
	lo --; assert(lo <= hi); // assuming f is decreasing
	while (lo < hi) { // find first index such that f is true 
		T mid = half(lo+hi+1);
		f(mid) ? lo = mid : hi = mid-1;
	} 
	return lo;
}
template<class T> void remDup(vector<T>& v) { 
	sort(all(v)); v.erase(unique(all(v)),end(v)); }

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) { 
	#ifdef LOCAL
		return b ? "true" : "false"; 
	#else 
		return ts((int)b);
	#endif
}
template<class A> str ts(complex<A> c) { 
	stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) {
	str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
	res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
	str res = ""; F0R(i,SZ) res += char('0'+b[i]);
	return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
	#ifdef LOCAL
		bool fst = 1; str res = "{";
		for (const auto& x: v) {
			if (!fst) res += ", ";
			fst = 0; res += ts(x);
		}
		res += "}"; return res;
	#else
		bool fst = 1; str res = "";
		for (const auto& x: v) {
			if (!fst) res += " ";
			fst = 0; res += ts(x);
		}
		return res;

	#endif
}
template<class A, class B> str ts(pair<A,B> p) {
	#ifdef LOCAL
		return "("+ts(p.f)+", "+ts(p.s)+")"; 
	#else
		return ts(p.f)+" "+ts(p.s);
	#endif
}

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
	pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
	pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
	cerr << ts(h); if (sizeof...(t)) cerr << ", ";
	DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
	#define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
	#define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
		 << __FUNCTION__  << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
	#define dbg(...) 0
	#define chk(...) 0
#endif

// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(str s = "") {
	unsyncIO();
	// cin.exceptions(cin.failbit); 
	// throws exception when do smth illegal
	// ex. try to read letter into int
	if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

int N = 2e5;
int res = 0;
vl A;
vs ans;

void add(int a, int b, int c) {
	ckmax(res,a);
	ckmax(res,b);
	ckmax(res,c);
	ans.pb("+ "+ts(a)+" "+ts(b)+" "+ts(c));
	A[c] = A[a]+A[b];
}

void les(int a, int b, int c) {
	ckmax(res,a);
	ckmax(res,b);
	ckmax(res,c);
	ans.pb("< "+ts(a)+" "+ts(b)+" "+ts(c));
	A[c] = A[a]<A[b];
}

ll prin() {
	dbg("PRIN");
	F0R(i,res+1) dbg(i,A[i]);
	dbg("HA",A[2]);
	return A[2];
}

const int ZERO = 3, ONE = 4;

void zero(int x) {
	add(ZERO,ZERO,x);
}
void inc(int x) {
	add(x,ONE,x);
}
void doub(int x) { add(x,x,x); }
void out() {
	ps(sz(ans));
	trav(t,ans) ps(t);
}
void dump(int num, int st, int trash) {
	R0F(i,30) {
		add(trash,i+4,trash+1);
		// dbg("HA",A[trash+1],A[num]);
		les(trash+1,num,trash+2);
		// dbg("??",A[trash+2]);
		add(trash+2,ZERO,st+i);
		F0R(j,i) doub(trash+2);
		add(trash,trash+2,trash);
		// if less:
			// subtract 2^i, 
			// add, 2^i
			// set st+i
		// i+5
	}
}
int main() {
	setIO();
	ll x = 1e9;
	ll y = 1e9; 
	// F0R(x,11) F0R(y,11) if (x||y) {
		dbg("TRYING",x,y);
		A = vl(N);
		A[0] = x, A[1] = y;
		add(0,1,5); les(ZERO,5,ONE); zero(5);
		inc(0), inc(1);
		// 4 -> ONE
		for (int i = 5; i-4 <= 2*29; ++i) {
			add(i-1,i-1,i);
		}
		// ps(A[4+2*29],1LL<<(2*29)); exit(0);
		dump(0,100,1000);
		dump(1,200,2000);
		// F0R(i,30) pr(A[100+i]);
		// ps();
		// F0R(i,30) pr(A[200+i]);
		// ps();
		// exit(0);
		F0R(i,30) F0R(j,30) {
			add(100+i,200+j,3000);
			les(ONE,3000,3000);
			F0R(z,i+j) doub(3000);
			add(2,3000,2);
		}
		// dump A[0]
		// F0R(i,)
		// F0R(i,10) F0R(j,10) {
		// 	zero(5), zero(6);
		// 	F0R(z,i) inc(5);
		// 	F0R(z,j) inc(6);
		// 	if (A[0] || A[1]) assert(A[5] == i && A[6] == j);
		// 	// dbg("WUT",A[5],A[6]);
		// 	les(5,0,7); les(6,1,8);
		// 	// dbg(A[7],A[8],A[8]);
		// 	// dbg("HUH")
		// 	add(7,8,8);
		// 	les(ONE,8,8);
		// 	add(2,8,2);
		// }
		// out();
		// dbg("???",x*y);
		// assert(prin() == x*y);
	out();
	// }
	// dbg("OK");
	// a[2] = result
	// a[3] = 0
	// a[4] = 1
	// you should actually read the stuff at the bottom
}

/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
*/



Measured memory_bytes: 6900