C++ :

#include <bits/stdc++.h>
using namespace std;
char a[7],b[7];
const int mod=47;
int ans1=1,ans2=1;
int ascii(char ch){
	char gg1 = '@';
	int gg2 = gg1;
	return ch - gg1;
}
void in(){
	scanf("%s\n%s", &a, &b);
}
void count(){
	for (int i = 0; i < strlen(a); i++)
		ans1 *= ascii(a[i]);
	for (int i = 0; i < strlen(b); i++)
		ans2 *= ascii(b[i]);
	ans1 %= mod;
	ans2 %= mod;
}
void tick(){
	if (ans1 == ans2) cout << "GO" << endl;
	else cout << "STAY" << endl;
}
int main(){
	in();
	count();
	tick();
}

Pascal :

program ride;
var
  n1,n2:string;
  len1,len2,i,s1,s2:longint;
begin
  readln(n1);
  readln(n2);
  len1:=length(n1);
  len2:=length(n2);
  s1:=1; s2:=1;
  for i:=1 to len1 do
    s1:=s1*(ord(n1[i])-64)mod 47;
  for i:=1 to len2 do
    s2:=s2*(ord(n2[i])-64)mod 47;
  if s1=s2 then writeln('GO')
    else writeln('STAY');
end.