#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

using namespace std;
typedef long long ll;
typedef pair<int, int> Pr;

string s;
int direction[4];

int main()
{
	cin >> s;
	for (int i = 0; i < s.size(); i++) {
		if (s[i] == 'N')direction[0]++;
		if (s[i] == 'E')direction[1]++;
		if (s[i] == 'W')direction[2]++;
		if (s[i] == 'S')direction[3]++;
	}
	int a = pow(abs(direction[0] - direction[3]), 2);
	int b = pow(abs(direction[2] - direction[1]), 2);

	printf("%f\n",sqrt(a+b));
	return 0;
}