UVa1636

氵

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<climits>
#include<cctype>
#include<queue>
#include<set>
#include<cmath>

using namespace std;

typedef long long ll;
const int INF=0x3f3f3f3f;
const int MAXN=1e2+5;
char s[MAXN];
const double EPS=1e-6;


int main()
{
	while(~scanf("%s",s))
	{
		int a=0,b=0,c=0;
		int len=strlen(s);
		for(int i=0;i<len;i++)
		{
			if(s[i]=='0') a++;
			if(s[i-1]=='0')
			{
				b++;
				if(s[i]=='0') c++;
			}
		}
		if(s[len-1]=='0')
		{
			b++;
			if(s[0]=='0') c++;
		}
		double shoot=(double)c/b;
		double rotate=(double)a/len;
		if(fabs(shoot-rotate)<EPS)
		{
			printf("EQUAL\n");
		}
		else if(rotate>shoot)
		{
			printf("ROTATE\n");
		}
		else
		{
			printf("SHOOT\n");
		}
	}
	return 0;
}