#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);

using namespace std;

namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const pair<S,T>&p)const{return ((size_t)1e9+7)*hash<S>()(p.first)+hash<T>()(p.second);}};template<class T>struct hash<vector<T>>{size_t operator()(const vector<T> &v)const{size_t h=0;for(auto i : v)h=h*((size_t)1e9+7)+hash<T>()(i)+1;return h;}};}
template<class T>ostream& operator<<(ostream &os, const vector<T> &v){os<<"[ ";rep(i,v.size())os<<v[i]<<(i==v.size()-1?" ]":", ");return os;}template<class T>ostream& operator<<(ostream &os,const set<T> &v){os<<"{ "; for(const auto &i:v)os<<i<<", ";return os<<"}";}
template<class T,class U>ostream& operator<<(ostream &os,const map<T,U> &v){os<<"{";for(const auto &i:v)os<<" "<<i.first<<": "<<i.second<<",";return os<<"}";}template<class T,class U>ostream& operator<<(ostream &os,const pair<T,U> &p){return os<<"("<<p.first<<", "<<p.second<<")";}
void dbgprint(const string &fmt){cerr<<endl;}template<class H,class... T>void dbgprint(const string &fmt,const H &h,const T&... r){cerr<<fmt.substr(0,fmt.find(","))<<"= "<<h<<" ";dbgprint(fmt.substr(fmt.find(",")+1),r...);}
typedef long long ll;typedef vector<int> vi;typedef pair<int,int> pi;const int inf = (int)1e9;const double INF = 1e12, EPS = 1e-9;

bool solve(vector<string> &res){
	vector<pair<string,int>> in;
	int id = 1;
	string s;
	cin >> s;
	in.emplace_back(s, 0);
	
	auto add = [&](string s, int a, int b){
		stringstream ss;
		ss << s << " " << a << " " << b;
		res.emplace_back(ss.str());
		
		if(s == "split"){
			rep(i, in.size()) if(in[i].second == a){
				a = i;
				break;
			}
			string t = in[a].first.substr(0, b + 1);
			string u = in[a].first.substr(b + 1);
			if(!(t.size() == 2 && (t == "ox" || t == "xo"))) in.emplace_back(t, id);
			if(!(u.size() == 2 && (u == "ox" || u == "xo"))) in.emplace_back(u, id + 1);
			id += 2;
			in.erase(in.begin() + a);
		}
		else{
			rep(i, in.size()) if(in[i].second == a){ a = i; break; }
			rep(i, in.size()) if(in[i].second == b){ b = i; break; }
			string t = in[a].first + in[b].first;
			if(a > b) swap(a, b);
			in.erase(in.begin() + b);
			in.erase(in.begin() + a);
			in.emplace_back(t, id++);
		}
	};
	while(in.size()){
		int rad = -1;
		rep(i, in.size()) if(in[i].first == "o"){
			rad = i;
			break;
		}
		rep(i, in.size()){
			string &s = in[i].first;
			if(s.size() < 2) continue;
			
			string t = s.substr(0, 2); sort(all(t));
			string u = s.substr(s.size() - 2); sort(all(u));
			if(t == "ox"){
				add("split", in[i].second, 1);
				goto SKIP;
			}
			if(u == "ox"){
				add("split", in[i].second, s.size() - 3);
				goto SKIP;
			}
		}
		if(rad >= 0) rep(i, in.size()){
			string &s = in[i].first;
			if(s.size() < 2) continue;
			
			if(s[0] == 'x'){
				add("join", in[rad].second, in[i].second);
				goto SKIP;
			}
			if(s[s.size()-1] == 'x'){
				add("join", in[i].second, in[rad].second);
				goto SKIP;
			}
		}
		rep(i, in.size()){
			string &s = in[i].first;
			if(s.size() < 2) continue;
			int o1 = 0, o2 = count(all(s), 'o'), x2 = s.size() - o2;
			rep(j, s.size() - 1){
				o1 += s[j] == 'o';
				o2 -= s[j] == 'o';
				x2 -= s[j] != 'o';
				if(2 * o1 >= j + 1 && o2 >= x2){
					add("split", in[i].second, j);
					goto SKIP;
				}
			}
		}
		rep(i, in.size()) if(in[i].first.size() > 2) return 0;
		break;
		SKIP:;
	}
	return 1;
}
int main(){
	cin.tie(0); cin.sync_with_stdio(0);
	int n; cin >> n;
	while(n--){
		vector<string> res;
		if(!solve(res)) cout << -1 << endl;
		else{
			cout << res.size() << endl;
			for(auto i : res) cout << i << endl;
		}
	}
	return 0;
}


Measured memory_bytes: 3172