#include <iostream>

#include <cstdio>

#include <cmath>

#include <cstring>

#include <cstdlib>

#include <algorithm>

typedef long long ll;

using namespace std;

const int maxn = 105;

char p[maxn];

int main()

{

    while(scanf("%s",p) != EOF)

    {

        int len =strlen(p);

        int anum = 0;

        int tnum;

        p[len] = p[0];

        for(int i = 0; i < len; i++)

        {

            if(p[i] == '0')

                anum++;

        }

        double rotat = (double)anum / len;

         tnum = 0;

        for(int i = 0; i < len; i++)

        {

            if(p[i] == '0' && p[i+1] == '0')

                tnum ++;

        }

        double shoot = (double)tnum/anum;

        if(shoot > rotat)

            printf("SHOOT\n");

        else if(shoot < rotat)

            printf("ROTATE\n");

        else

            printf("EQUAL\n");

    }

    return 0;

}