/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/

#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define i64 long long
#define pb push_back
#define ff first
#define ss second
#define isz(x) (int)x.size()
using namespace std;

const int mxN = 2e5 + 5;
const int mod = 1e9 + 7;
const i64 oo = 1e18;

vector<pair<int, int>> dir = {{2, 0}, {-2, 0}, {0, 2}, {0, -2}};

void view() {
    int n; cin >> n;
    vector<vector<char>> a(2 * n + 1, vector<char>(2 * n + 1));
    for (int i = 2 * n; i >= 0; --i) for (int j = 0; j <= 2 * n; ++j) cin >> a[i][j];

    // for (auto vec : a) {
    //     for (auto ch : vec) cout << ch;
    //     cout << endl;
    // }

    vector<vector<int>> dis(2 * n + 2, vector<int>(2 * n + 2, mod));
    queue<pair<int, int>> q;
    dis[2 * n - 1][2 * n - 1] = 0; q.emplace(2 * n - 1, 2 * n - 1);
    while (not q.empty()) {
        auto [x, y] = q.front(); q.pop();
        // cout << x << " " << y << " " << dis[x][y] << endl;
        for (auto [dx, dy] : dir) {
            int px = x + dx / 2, py = y + dy / 2;
            int nx = x + dx, ny = y + dy;
            if (a[px][py] == '.' and dis[nx][ny] == mod) {
                dis[nx][ny] = dis[x][y] + 1;
                q.emplace(nx, ny);
            }
        }
    }

    {
        string res;
        int x = 1, y = 1;
        while (x != 2 * n - 1 or y != 2 * n - 1) {
            // cout << x << " " << y << endl;
            int tx = -1, ty = -1, cnt = 0, pos = 0;
            for (auto [dx, dy] : dir) {
                int px = x + dx / 2, py = y + dy / 2;
                int nx = x + dx, ny = y + dy;
                if (a[px][py] == '.' and dis[nx][ny] == dis[x][y] - 1) tx = dx, ty = dy, pos = cnt, ++cnt;
                else cnt += a[px][py] == '.';
            }

            if (cnt == 2) res.push_back(pos + '0');
            else if (cnt == 3) res.push_back((pos >> 1) + '0'), res.push_back((pos & 1) + '0');
            else assert(cnt == 1);
            a[x + tx / 2][y + ty / 2] = '#', x += tx, y += ty;
        }
        // if (isz(res) > 1000) {
        //     cout << dis[1][1] << endl;
        //     return;
        // }
        // assert(dis[1][1] <= 1000);
        assert(isz(res) <= 1000);
        cout << res << endl;
    }
}

void walk() {
    string s; cin >> s;
    int n; cin >> n;

    swap(dir[0], dir[1]);

    int x = n, y = 1, ptr = 0, pre = -1;
    vector<vector<char>> a(3, vector<char>(3));
    while (x != 1 or y != n) {
        for (int i = 0; i < 3; ++i) for (int j = 0; j < 3; ++j) cin >> a[i][j];
        if (pre == 0) a[0][1] = '#';
        if (pre == 1) a[1][2] = '#';
        if (pre == 2) a[2][1] = '#';
        if (pre == 3) a[1][0] = '#';

        int cnt = 0;
        for (auto [dx, dy] : dir) {
            cnt += a[1 + dx / 2][1 + dy / 2] == '.';
        }

        int cx = -1, cy = -1;
        // cout << "cnt: " << cnt << endl;

        if (cnt == 1) {
            int goal = 0, cur = 0;
            for (auto [dx, dy] : dir) if ((cur += (a[1 + dx / 2][1 + dy / 2] == '.')) > goal) {
                cx = dx, cy = dy;
                break;
            }
        }
        else if (cnt == 2) {
            int goal = s[ptr] - '0', cur = 0;
            for (auto [dx, dy] : dir) if ((cur += (a[1 + dx / 2][1 + dy / 2] == '.')) > goal) {
                cx = dx, cy = dy;
                break;
            }
            // cout << cur << endl;
            ptr += 1;
        }
        else {
            int goal = (s[ptr] - '0') << 1 | (s[ptr + 1] - '0'), cur = 0;
            for (auto [dx, dy] : dir) if ((cur += (a[1 + dx / 2][1 + dy / 2] == '.')) > goal) {
                cx = dx, cy = dy;
                break;
            }
            ptr += 2;
        }

        assert(cx != -1);

        if (cx == 2) cout << 'S', ++x, pre = 0;
        if (cy == -2) cout << 'W', --y, pre = 1;
        if (cx == -2) cout << 'N', --x, pre = 2;
        if (cy == 2) cout << 'E', ++y, pre = 3;
        cout << endl;
    }
}

string name;

void solve() {
    cin >> name;
    if (name == "view") view();
    else walk();
}

signed main() {

#ifndef CDuongg
    if(fopen(taskname".inp", "r"))
        assert(freopen(taskname".inp", "r", stdin)), assert(freopen(taskname".out", "w", stdout));
#else
    freopen("bai3.inp", "r", stdin);
    freopen("bai3.out", "w", stdout);
    auto start = chrono::high_resolution_clock::now();
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1; //cin >> t;
    while(t--) solve();

#ifdef CDuongg
   auto end = chrono::high_resolution_clock::now();
   cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
   cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
   cout << "Check array size pls sir" << endl;
#endif

}