#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define pll pair <ll,ll>
#define fi first
#define se second
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1LL)
#define MASK(i) (1LL << (i))
#define MP(x,y) make_pair((x),(y))
string s[500];
ll dist[210][210];
pll trace[210][210];
string all_dir = "NWSE";
ll mx[] = {0,-1,0,1};
ll my[] = {1,0,-1,0};
pll mv(pll x,ll dir){
    return {x.fi+mx[dir],x.se+my[dir]};
}
ll find_dir(pll u, pll v){
    for (ll i = 0;i < 4;i ++){
        if (mv(u,i)==v)return i;
    }
    assert(0);
}
int main(){
    string task;
    cin>>task;
    if (task=="view"){
        ll n;
        cin>>n;
        for (ll i = 1;i <= 2 * n + 1;i ++){
            cin>>s[i];
            s[i] = "x" + s[i];
        }
//        for (ll i=  1;i <= 2 * n + 1;i ++){
//            for (ll j = 1;j <= 2 * n + 1;j ++){
//                cout<<s[i][j];
//            }
//            cout<<endl;
//        }
        auto get_pos = [&](pll u){
            return s[2*n+2-u.se][u.fi]=='.';
        };
//        cout<<get_pos(MP(4*2,1*2+1))<<endl;
        priority_queue <pair<ll,pll>,vector <pair <ll,pll> >, greater <pair <ll,pll> > > q;
        memset(dist,0x3f,sizeof dist);
        dist[1][1] = 2;
        q.push(MP(2,MP(1,1)));
        while (!q.empty()){
            pll u = q.top().se;
            ll val = q.top().fi;
            q.pop();
            if (dist[u.fi][u.se] != val)continue;
            u.fi *= 2,u.se *= 2;
            vector <pll> adj;
            for (ll i = 0;i < 4;i ++){
                pll wall = mv(u,i);
                if (get_pos(wall)){
                    pll nw = mv(wall,i);
                    adj.push_back(nw);
                }
            }
            ll w = max(0ll,sz(adj)-2);
            u.fi/=2,u.se/=2;
            for (auto v:adj){
                v.fi/=2,v.se/=2;
//                if (u==MP(4LL,1LL)){
//                    cout<<"SUS "<<v.fi<<' '<<v.se<<endl;
//                }
                if (dist[v.fi][v.se]>w+val){
                    trace[v.fi][v.se] = u;
                    dist[v.fi][v.se] = w+val;
                    q.push(MP(w+val,v));
                }
            }
        }
        vector <pll> path;
        pll cur = MP(n,n);
        assert(dist[n][n]<=1000);
        while (1){
            path.push_back(cur);
            if (cur==MP(1LL,1LL))break;
            cur = trace[cur.fi][cur.se];
        }
        reverse(path.begin(),path.end());
        string ans;
        auto add = [&](ll x,ll y){
            if (y==0)return;
            else if (y==1){
                assert(0<=x&&x<=1);
                ans.push_back(x+'0');
            }
            else{
                assert(0<=x&&x<=3);
                ans.push_back(BIT(x,0)+'0');
                ans.push_back(BIT(x,1)+'0');
            }
        };
        for (ll i = 0;i + 1 < sz(path);i ++){
//            cout<<path[i].fi<<' '<<path[i].se<<'\n';
            if (i == 0){
                add(find_dir(path[0],path[1]),2);
            }
            else{
                ll nxt = find_dir(path[i],path[i+1]);
                pll u = path[i];
                u.fi*=2,u.se*=2;
                ll cnt = 0;
                ll id = -1;
                for (ll j = 0;j < 4;j ++){
                    pll wall = mv(u,j);
                    if (j == find_dir(path[i],path[i-1]))continue;
                    if (get_pos(wall)){
                        if (mv(path[i],j)==path[i+1]){
                            id = cnt;
                        }
                        cnt++;
                    }
                }
                if (cnt==3)add(nxt,2);
                if (cnt==2){
                    add(id,1);
                }
            }
        }
        cout<<ans<<endl;
    }
    else{
        string hint;
        cin>>hint;
        ll n;
        cin>>n;
        string s[3];
        ll ptr = 0;
        ll pre = 0;
        while (cin>>s[0]>>s[1]>>s[2]){
            swap(s[0],s[2]);
            if (ptr==0){
                pre = (hint[ptr]-'0')*MASK(0)+(hint[ptr+1]-'0')*MASK(1);
                ptr+=2;
            }
            else{
                ll cnt = (s[0][1]=='.') + (s[1][0]=='.') + (s[1][2]=='.') + (s[2][1]=='.');
                if (cnt==1){
                    break;
                }
                else if (cnt==2){
                    for (ll i = 0;i < 4;i ++){
                        pll nw = mv(MP(1,1),i);
                        if (i != (pre+2)%4 && s[nw.se][nw.fi]=='.'){pre = i;break;}
                    }
                }
                else if (cnt==3){
                    ll w = hint[ptr++]-'0';
                    for (ll i = 0;i < 4;i ++){
                        pll nw = mv(MP(1,1),i);
                        if (i != (pre+2)%4 && s[nw.se][nw.fi]=='.'){
                            if (w--==0){
                                pre = i;
                                break;
                            }
                        }
                    }
                }
                else if (cnt==4){
                    pre = (hint[ptr]-'0')*MASK(0)+(hint[ptr+1]-'0')*MASK(1);
                    ptr+=2;
                }
            }
            cout<<all_dir[pre]<<endl;
        }
    }
    return 0;
}
/*
view
5
###########
#.#.......#
#.###.#####
#.#.....#.#
#.#.###.#.#
#...#.....#
###.#######
#.........#
###.#######
#.........#
###########
walk
11000001
5
###
#..
###
#.#
...
###
#.#
...
#.#
#.#
..#
#.#
###
#..
#.#
#.#
...
###
###
...
#.#
###
...
###
###
..#
###
*/