Go: package main

import (
	"bufio"
	"os"
	"strconv"
	"strings"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

type Point struct {
	x, y int
}

func main() {
	dx := []int{1, 0, -1, 0}
	dy := []int{0, -1, 0, 1}
	maze := make([][]rune, 30)
	for i := range maze {
		maze[i] = make([]rune, 30)
	}
	next := make([][]rune, 30)
	for i := range next {
		next[i] = make([]rune, 30)
	}
	check := make([][]int, 30)
	for i := range check {
		check[i] = make([]int, 30)
	}
	for scanner.Scan() {
		buf := strings.Split(scanner.Text(), " ")
		W, _ := strconv.Atoi(buf[0])
		H, _ := strconv.Atoi(buf[1])
		if W == 0 && H == 0 {
			break
		}
		for i := 0; i < H; i++ {
			scanner.Scan()
			buf_ := scanner.Text()
			for j, v := range buf_ {
				maze[i][j] = v
			}
		}
		man := 0
		for i := 0; i < H; i++ {
			for j := 0; j < H; j++ {
				if maze[i][j] != '.' && maze[i][j] != 'X' && maze[i][j] != '#' {
					switch maze[i][j] {
					case 'E':
						maze[i][j] = 0
						man++
					case 'N':
						maze[i][j] = 1
						man++
					case 'W':
						maze[i][j] = 2
						man++
					case 'S':
						maze[i][j] = 3
						man++
					}
				}
			}
		}
		ans := -1
		for t := 0; t <= 180; t++ {
			if man == 0 {
				ans = t
				break
			}
			for i := 0; i < H; i++ {
				for j := 0; j < W; j++ {
					check[i][j] = 0x7FFFFFFF
				}
			}
			for i := 0; i < H; i++ {
				for j := 0; j < W; j++ {
					if maze[i][j] > 3 {
						continue
					}
					l := (maze[i][j] + 3) % 4
					for k := 0; k < 4; k++ {
						y := i + dy[l]
						x := j + dx[l]
						if 0 <= y && y < H && 0 <= x && x < W && (maze[y][x] == '.' || maze[y][x] == 'X') {
							maze[i][j] = l
							check[y][x] = min(check[y][x], int((l+2)%4))
							break
						}
						l = (l + 1) % 4
					}
				}
			}
			for i := 0; i < H; i++ {
				for j := 0; j < W; j++ {
					next[i][j] = maze[i][j]
				}
			}
			for i := 0; i < H; i++ {
				for j := 0; j < W; j++ {
					if maze[i][j] > 3 {
						continue
					}
					y := i + dy[maze[i][j]]
					x := j + dx[maze[i][j]]
					if 0 <= y && y < H && 0 <= x && x < W && check[y][x] == int((maze[i][j]+2)%4) {
						if maze[y][x] == '.' {
							next[y][x] = maze[i][j]
						} else if maze[y][x] == 'X' {
							man--
						}
						next[i][j] = '.'
					}
				}
			}
			for i := 0; i < H; i++ {
				for j := 0; j < W; j++ {
					maze[i][j]=next[i][j]
				}
			}
		}
		if ^ans != 0 {
			fmt.Println(ans)
		} else {
			fmt.Println("NA")
		}
	}
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

Python: from sys import stdin
# from line_profiler import LineProfiler

def main():

    head = [[8,1,2,4],[1,2,4,8],[2,4,8,1],[4,8,1,2]]

    while(True):
        W,H = map(int, stdin.readline().split())
        m = [[0]*W for _ in range(H)]
        ps = []
        if not (W or H): break
        for h in range(H):
            s = stdin.readline()
            for w in range(W):
                if s[w] in [".", "X", "E", "N", "W", "S"]:
                    m[h][max(0,w-1)] |= 1
                    m[min(H-1,h+1)][w] |= 2
                    m[h][min(W-1,w+1)] |= 4
                    m[max(0,h-1)][w] |= 8
                if s[w] in ["E", "N", "W", "S"]:
                    ps.append([h,w,["E", "N", "W", "S"].index(s[w])])
                if s[w] == "X":
                    m[h][w] |= 16
        if W <= 2 or H <= 2:
            print(1)
            continue
        ttt = 0
        while(True):
            ttt += 1
            if ttt > 180: print("NA"); break
            dest = []
            positions = [a[:2] for a in ps]
            for pi,p in enumerate(ps):
                for i in range(4):
                    if head[p[2]][i] & m[p[0]][p[1]]:
                        d = head[p[2]][i]
                        if   d == 1 and not [p[0],p[1]+1] in positions: p[2] = 0; dest.append([pi,2,p[0],p[1]+1]); break
                        elif d == 2 and not [p[0]-1,p[1]] in positions: p[2] = 1; dest.append([pi,3,p[0]-1,p[1]]); break
                        elif d == 4 and not [p[0],p[1]-1] in positions: p[2] = 2; dest.append([pi,0,p[0],p[1]-1]); break
                        elif d == 8 and not [p[0]+1,p[1]] in positions: p[2] = 3; dest.append([pi,1,p[0]+1,p[1]]); break
                else:
                    dest.append([pi,(p[2]+2)&3,p[0],p[1]])
            dest = sorted(dest,key=lambda x: (x[2:],x[1]))
            dellist = []
            for pi,d,dy,dx in dest:
                if not [dy,dx] in positions: positions.append([dy,dx]); ps[pi][:2] = [dy,dx]
                if m[ps[pi][0]][ps[pi][1]] & 16: dellist.append(pi)
            for idx in sorted(dellist)[::-1]: del ps[idx]
            if not len(ps): print(ttt); break

if __name__ == "__main__":
    # prf = LineProfiler()
    # prf.add_function(main)
    # prf.runcall(main)
    # prf.print_stats()
    main()

C++: #include<iostream>
#include<cstdio>
#include<cmath>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<sstream>

#define rep(i,n) for(int i = 0; i < (n); i++)
#define reps(i,n) for(int i = 1; i <= (n); i++)
#define PII pair<int,int>
#define PP pair< int,PII >

using namespace std;

int W,H;
char cell[32][32];
char map[32][32];

int newsm[4][2] = {{-1, 0}, {0,-1}, {1, 0}, {0,1}};
char news[] = "WNES";
int move[] = {1, 0, 3, 2};	//方角を見る順番

int canMove(char x){
	if(x == 'X' || x == '.')
		return 1;
	return 0;
}

void step1(){
	for(int i = 0; i < H; i++){
		for(int j = 0; j < W; j++){
			if('A' < map[i][j] && map[i][j] < 'X'){
				for(int k = 0; k < 4; k++){
					if(map[i][j] == news[k]){
						for(int l = 0; l < 4; l++){
							if(canMove(map[i+newsm[(k+move[l])%4][1]][j+newsm[(k+move[l])%4][0]])){
								map[i][j] = news[(k+move[l])%4];
								break;
							}
						}
						break;
					}
				}
			}
		}
	}
}

void step2(){
	for(int i = 0; i < H; i++){
		for(int j = 0; j < W; j++){
			cell[i][j] = -1;
		}
	}
	
	for(int i = 0; i < H; i++){
		for(int j = 0; j < W; j++){
			if('A' < map[i][j] && map[i][j] < 'X'){
				for(int k = 0; k < 4; k++){
					if(map[i][j] == news[k]){
						if(cell[i+newsm[k][1]][j+newsm[k][0]] == -1){
							cell[i+newsm[k][1]][j+newsm[k][0]] = map[i][j];
							map[i][j] = '.';
						}else{
							cell[i][j] = map[i][j];
						}
					}
				}
			}
		}
	}
	
	for(int i = 0; i < H; i++){
		for(int j = 0; j < W; j++){
			if(cell[i][j] != -1 && map[i][j] == '.'){
				map[i][j] = cell[i][j];
			}
		}
	}
}

int step3(){
	for(int i = 0; i < H; i++){
		for(int j = 0; j < W; j++){
			if('A' < map[i][j] && map[i][j] < 'X'){
				return 1;
			}
		}
	}
	return 0;
}

int main(void){
	
	while(1){
		int i;
		scanf("%d%d", &W, &H);
		if(H==0)break;
		rep(i,H)
			scanf("%s", map[i]);
		for(i = 1; i < 181; i++){
			step1();
			//rep(i,H)puts(map[i]);
			step2();
			//rep(i,H)puts(map[i]);
			if(!step3()){
				break;
			}
		}
		if(i == 181){
			puts("NA");
		}else{
			printf("%d\n", i);
		}
	}
	return 0;
}