#include <bits/stdc++.h>
using namespace std;
char a[301][301],b[101][101];
int dx[200],dy[200];
void dfs(char f,int x,int y,int c){
	string s="SUCC";
	int p;
	if(c==1)p=3;
	else p=4;
	while(s=="SUCC"){
		cout<<"GO\n";
		cin>>s;
		if(s=="SUCC")x+=dx[f],y+=dy[f],a[x][y]='.';
	}
	a[x+dx[f]][y+dy[f]]='#';
	for(int i=1;i<=p;i++){
		cout<<"LEFT\n";
		cin>>s;
		char u=s[0];
		cout<<"GO\n";
		cin>>s;
		if(s=="SUCC")x+=dx[u],y+=dy[u],a[x][y]='.',dfs(s[0],x,y,c+1);
		else a[x+dx[u]][y+dy[u]]='#';
	}
}
int main(){
	for(int i=1;i<=300;i++){
		for(int j=1;j<=300;j++){
			a[i][j]=' ';
		}
	}
	dx['N']=1;dx['S']=-1;dy['E']=1;dy['W']=-1;
	string s;
	cout<<"LEFT\n";
	cin>>s;
	a[100][100]='.';
	dfs(s[0],100,100,1);
	cout<<"END\n";
	int l=0;
	for(int i=1;i<=300;i++){
		l=0;
		for(int j=1;j<=300;j++){
			if(a[i][j]=='.'||a[i][j]=='#'){
				cout<<a[i][j];l=1;
			}
		}
		if(l==1)cout<<endl;
	} 
	return 0;
}