// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=205;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

int dx[]={0,1,0,-1},
    dy[]={1,0,-1,0};
char dc[]={'E','S','W','N'};

char c[2*maxn][2*maxn];
int d[maxn][maxn],trace[maxn][maxn];
vector<int> g[maxn][maxn];

void view(){
    int n;cin >> n;
    for(int i=1;i<=2*n+1;i++) for(int j=1;j<=2*n+1;j++) cin >> c[i][j];
    for(int i=1;i<=n;i++) for(int j=1;j<=n;j++){
        d[i][j]=inf;
        trace[i][j]=-1;
        for(int t=0;t<4;t++){
            int xt=i*2+dx[t],yt=j*2+dy[t];
            if(c[xt][yt]=='.') g[i][j].push_back(t);
        }
    }
    priority_queue<piii,vector<piii>,greater<piii>> pq;
    d[n][1]=0;trace[n][1]=-1;
    pq.push({0,{n,1}});
    while(!pq.empty()){
        auto [dd,p]=pq.top();pq.pop();
        auto [x,y]=p;
        if(d[x][y]!=dd) continue;
        int w=max(0LL,(int)g[x][y].size()-2);
        for(int t:g[x][y]){
            int xt=x+dx[t],yt=y+dy[t];
            if(dd+w<d[xt][yt]){
                d[xt][yt]=dd+w;
                trace[xt][yt]=t;
                pq.push({dd+w,{xt,yt}});
            }
        }
    }
    string res;
    int x=1,y=n;
    while(trace[x][y]!=-1){
        int t=trace[x][y];
        x+=dx[t^2];y+=dy[t^2];
        int pos=0;
        for(int i=0;i<(int)g[x][y].size();i++){
            if((g[x][y][i]^2)==trace[x][y]) continue;
            if(t==g[x][y][i]) break;
            pos++;
        }
        for(int i=0;i<(int)g[x][y].size()-1-(trace[x][y]!=-1);i++){
            res+=char('0'+(pos&1));
            pos>>=1;
        }
    }
    cout << res << '\n';
}
void walk(){
    string s;cin >> s;
    int n;cin >> n;
    int x=n,y=1,pre=-1;
    vector<vector<char>> cc(3,vector<char>(3));
    while(x!=1 || y!=n){
        for(int i=0;i<3;i++) for(int j=0;j<3;j++) cin >> cc[i][j];
        vector<int> nxt;
        for(int t=0;t<4;t++){
            int xt=1+dx[t],yt=1+dy[t];
            if(cc[xt][yt]=='.') nxt.push_back(t);
        }
        int pos=0;
        for(int i=0;i<(int)nxt.size()-1-(pre!=-1);i++){
            pos=pos<<1|(s.back()-'0');
            s.pop_back();
        }
        int nt=-1;
        for(int t:nxt){
            if((t^2)==pre) continue;
            if(!pos){nt=t;break;}
            pos--;
        }
        cout << dc[nt] << endl;
        x+=dx[nt];y+=dy[nt];pre=nt;
    }
    for(int i=0;i<3;i++) for(int j=0;j<3;j++) cin >> cc[i][j];
}
void solve(){
    string s;cin>> s;
    if(s=="view") view();
    else walk();
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}