#include "bits/stdc++.h" using namespace std; using Graph = vector>; typedef long long ll; typedef pair P; #define rep(i,n) for (ll i = 0; i < (n); ++i) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() const long long mod = 1e9 + 7; ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } int main() { string s; cin >> s; ll x=0; ll y=0; rep(i, s.size()) { if (s[i] == 'N') { x++; } else if (s[i] == 'E') { y++; } else if (s[i] == 'W') { y--; } else if (s[i] == 'S') { x--; } } double ans=sqrt(pow(x,2)+pow(y,2)); cout << ans << endl; }