#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <string>
#include <list>
#include <cassert>
#include <numeric>
#include <cstdint>
#include <queue>
#include <deque>
#include <stack>
#include <set>
// #include <atcoder/all>
 
using ll = long long;
using ld = long double;
using namespace std;
// using namespace atcoder;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
using Priority = priority_queue<ll, vector<ll>, greater<ll>>;// 昇順
using Priority_pair = priority_queue<P, vector<P>, greater<P>>;
// using mint_17 = modint1000000007;
// using mint = modint998244353;

// typedef pair<int,int> P;
#define mod 1000000007
#define MAX_WIDTH 60
#define MAX_HEIGHT 60
#define INF 1e18
#define MOD 998244353
#define PI 3.141592653589793

char A, B;
string S = "ESWN";
int main(){
    cin >> A >> B;

    ll now = 0;
    map<char, int> rel;
    for(int i=0;i<4;i++) {
        rel[S[i]] = i;
        if(S[i] == A) now = i;
    }

    ll cnt = 0;
    while(1) {
        if(S[now % 4] == B) {
            cout << cnt << endl;
            return 0;
        }
        now++;
        cnt++;
    }

    return 0;
}