#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
const int MOD = 1000000007;

int N;
int a[55];

int main(){
    string S;
    cin >> S;

    int x = 0, y = 0;
    for(int i = 0; i < S.size(); i++){
        switch(S[i]){
        case 'N': y++; break;
        case 'S': y--; break;
        case 'W': x++; break;
        case 'E': x--; break;
        }
    }

    printf("%.9f\n", sqrt(0.+x*x+y*y));

    return 0;
}