//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
template<class T>
void dmp(T a){
	rep(i,a.size()) cout << a[i] << " ";
	cout << endl;
}
template<class T>
bool chmax(T&a, T b){
	if(a < b){
		a = b;
		return 1;
	}
	return 0;
}
template<class T>
bool chmin(T&a, T b){
	if(a > b){
		a = b;
		return 1;
	}
	return 0;
}
template<class T>
void g(T &a){
	cin >> a;
}
template<class T>
void o(const T &a,bool space=false){
	cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const ll mod = 1000000007;//998244353

struct Q{
	int ope, x, y, z;
	Q(){}
	Q(int a, int b, int c, int d){
		ope = a;
		x = b;
		y = c;
		z = d;
	}
};
vector<Q>ans;
ll buf[200005];
void verify(){
	rep(i, ans.size()){
		assert(ans[i].x < 200000 && ans[i].y < 200000 && ans[i].z < 200000);
		assert(ans[i].x >= 0 && ans[i].y >= 0 && ans[i].z >= 0);
	}
	rep(a, 11) rep(b, 11){
		memset(buf, 0, sizeof(buf));
		buf[0] = a; buf[1] = b;
		rep(i, ans.size()){
			if(ans[i].ope == 0){
				buf[ans[i].z] = buf[ans[i].x] + buf[ans[i].y];
			}
			else{
				buf[ans[i].z] = (int)(buf[ans[i].x] < buf[ans[i].y]);
			}
			//if(i == 19){
			//	cout << ans[i].x << " " << ans[i].y << " " << ans[i].z << endl;
			//	cout << buf[ans[i].z] << endl;
			//}
		}
		if(buf[2] != a * b){
			cout << "FAIL " << a << " " << b << " " << buf[2] << endl;
		}
	}
}
void verify2(){
	mt19937 mt(61471);
	rep(tm, 1000){
		{//rep(a, 11) rep(b, 11){
			ll a = mt() % 1000000001;
			ll b = mt() % 1000000001;
			memset(buf, 0, sizeof(buf));
			buf[0] = a; buf[1] = b;
			rep(i, ans.size()){
				if(ans[i].ope == 0){
					buf[ans[i].z] = buf[ans[i].x] + buf[ans[i].y];
				}
				else{
					buf[ans[i].z] = (int)(buf[ans[i].x] < buf[ans[i].y]);
				}
				//if(i == 19){
				//	cout << ans[i].x << " " << ans[i].y << " " << ans[i].z << endl;
				//	cout << buf[ans[i].z] << endl;
				//}
			}
			if(buf[2] != a * b){
				cout << "FAIL2 " << a << " " << b << " " << buf[2] << endl;
			}
		}
	}
}

//p...0 or 1
//q...0 or 1
//set p&q to r
void bitwise_and(int p, int q, int r){
	ans.pb(Q(0, p, q, 150000));
	ans.pb(Q(1, 199999, 150000, r));
}
//0...+
//1...<
int main(){
	//produce 1
	//only when a + b = 0 it fails, yet no problem :)
	ans.pb(Q(0, 0, 1, 100000));
	ans.pb(Q(1, 199999, 100000, 199999));
	//buf[199999] = 1
	//buf[199999-i] = (1<<i)
	for(int i=1;i<=63;i++){
		ans.pb(Q(0, 200000-i, 200000-i, 199999-i));
	}
	//represent a in binary representation
	//100 to 129
	/*
	cur <- buf[100000]
	tmp <- buf[100001]
	target <- buf[0]
	target+1 <- buf[99999]
	
	cur = 0
	for i : 29 to 0
		tmp = cur + (1<<i)
		if tmp < target+1: (equivalent to tmp <= target)
			cur += (1<<i)
	*/
	ans.pb(Q(1, 100000, 100000, 100000));
	ans.pb(Q(0, 0, 199999, 99999));
	for(int i=29;i>=0;i--){
		ans.pb(Q(0, 100000, 199999-i, 100001));
		ans.pb(Q(1, 100001, 99999, 150000));
		ans.pb(Q(0, 100+i, 150000, 100+i));
		rep(x, i){
			ans.pb(Q(0, 150000, 150000, 150000));
		}
		ans.pb(Q(0, 100000, 150000, 100000));
	}
	//represent b in binary representation
	//200 to 229
	/*
	cur <- buf[100000]
	tmp <- buf[100001]
	target <- buf[0]
	target+1 <- buf[99999]
	
	cur = 0
	for i : 29 to 0
		tmp = cur + (1<<i)
		if tmp < target+1: (equivalent to tmp <= target)
			cur += (1<<i)
	*/
	ans.pb(Q(1, 100000, 100000, 100000));
	ans.pb(Q(0, 1, 199999, 99999));
	for(int i=29;i>=0;i--){
		ans.pb(Q(0, 100000, 199999-i, 100001));
		ans.pb(Q(1, 100001, 99999, 150000));
		ans.pb(Q(0, 200+i, 150000, 200+i));
		rep(x, i){
			ans.pb(Q(0, 150000, 150000, 150000));
		}
		ans.pb(Q(0, 100000, 150000, 100000));
	}
	//cout << ans.size() << endl;
	//100 to 129 * 200 to 229
	rep(i, 30) rep(j, 30){
		bitwise_and(100+i, 200+j, 150000);
		ans.pb(Q(0, 300+i+j, 150000, 300+i+j));
	}
	for(int i=58;i>=0;i--){
		ans.pb(Q(0, 301+i, 301+i, 301+i));
		ans.pb(Q(0, 301+i, 300+i, 300+i));
	}
	ans.pb(Q(0, 300, 2, 2));
	verify();
	verify2();
	printf("%d\n", ans.size());
	rep(i, ans.size()){
		printf("%c %d %d %d\n",(ans[i].ope==0?'+':'<'), ans[i].x, ans[i].y, ans[i].z);
	}
}


Measured memory_bytes: 5280