#include <queue> 
#include <math.h> 
#include <stack> 
#include <stdio.h>
#include <iostream>
#include <vector> 
#include <iomanip> 
#include <string.h> 
#include <algorithm>
using namespace std;
#define LL long long
const int N = 1e5 + 10; 
const int INF = 0x3f3f3f3f; 
char a[N],b[N];
int main() 
{ 
    cin >> a >> b;
    int lena = strlen(a);
    int lenb = strlen(b);
    int sum1,sum2;
    sum1 = sum2 = 1;
    for(int i = 0;i < lena;i++)
    {
        sum1 = (sum1*(a[i]-'A'+1)) %47;
    }
    for(int j=0;j<lenb;j++)
    {
        sum2 = (sum2*(b[j]-'A'+1)) %47;
    }
    if(sum1==sum2)
    {
        cout<<"GO" <<endl <<"r1=" << "r2=" <<sum1;
    }
    else
    {
        cout<<"STAY"<<endl<<"r1="<<sum1<<" "<<"r2="<<sum2;
    }
    return 0;
}