#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<lint> vlint;

#define inf 1e+9
#define endl "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define rep_rev(i, n) for (int i = n-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()

#define pb push_back
#define eb emplace_back
#define Size(c) (int)(c).size()

#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))

template <class T> using pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;

template <class T, class S> inline bool chmax(T &a, S b) {
    if(a < b) {a = b;return 1;} return 0;
}
template <class T, class S> inline bool chmin(T &a, S b) {
    if(a > b) {a = b;return 1;} return 0;
}
template <class T>
void line(vector<T> &x){for (auto&& xi : x) cin >> xi;}

inline void IN(void){ return;}

template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){ cin >> first; IN(rest...); return;}

#define INT(...) int __VA_ARGS__; IN (__VA_ARGS__)
#define LINT(...) lint __VA_ARGS__; IN (__VA_ARGS__)
#define STR(...) string __VA_ARGS__; IN(__VA_ARGS__)

template <class T> void UNIQUE(vector<T> &x) {
    sort(all(x)); x.erase(unique(all(x)), x.end());
}
template <class T> void print_vec(T first, T end){
    for (auto i = first; i < end - 1; i++) cout << *i << " ";
    cout << *(end-1) << endl;
}

template<class... T>
void debug_print(T... args){
    vector<lint> tmp = initializer_list<lint>{args...};
    print_vec(all(tmp));
}
template<class T>
void print(T a){ cout << a << endl;}

vector<string> Yes = {"No", "Yes"};
vector<string> YES = {"NO", "YES"};

int ord(char x){ return (int)(x - 'a');}
char chr(lint x){ return (char)(x + (lint)('a'));}
lint mod = 1e9+7;
// lint mod = 

lint sum(vlint a){lint ret = 0; for(auto&& v:a) ret += v; return ret;}
lint vmini(vlint a, lint &index){
    lint ret = LLONG_MAX;
    rep(i, Size(a)){ if (chmin(ret, a[i])) index = i;}
    return ret;
}
lint vmaxi(vlint a, lint &index){
    lint ret = -LLONG_MAX;
    rep(i, Size(a)){ if (chmax(ret, a[i])) index = i;}
    return ret;
}

lint vmin(vlint a){
    lint ret = LLONG_MAX; for (auto && v : a) chmin(ret, v); return ret;
}
lint vmax(vlint a){
    lint ret = -LLONG_MAX; for (auto && v : a) chmax(ret, v); return ret;
}

int main(){
    INT(n); STR(s);
    vlint leftw(n+1, 0), rightw(n+1, 0);
    vlint lefte(n+1, 0), righte(n+1, 0);
    rep(i, n){
        if (s[i] == 'W'){
            leftw[i] ++;
        }
        else{
            lefte[i] ++;
        }
        leftw[i+1] += leftw[i]; lefte[i+1] += lefte[i];
    }
    for (int i = n-1; i > 0; --i){
        if (s[i] == 'W'){
            rightw[i]++;
        }
        else{
            righte[i]++;
        }
        rightw[i-1] += righte[i];
        righte[i-1] += righte[i];
    }

    lint ans = 2 * n;
    rep1(i, n-1){
        chmin(ans, leftw[i-1] + righte[i+1]);
    }
    chmin(ans, righte[1]); chmin(ans, leftw[n-2]);
    print(ans);

}

#include <bits/stdc++.h>
using namespace std;
int main(){
    int n; cin >> n;
    string s; cin >> s;
    int w = 0, e = 0;
    for(int i=0; i<n; ++i){
        if(s[i]=='W'){w++;}
    }
    e = n-w;
    int nw = 0, ne = e;
    int mi = INT32_MAX; int c;
    for(int i=0; i<n; ++i){
        if(s[i]=='W' && i>0){nw++;}
        if(s[i]=='E' && i>0){ne--;}
        int pen = nw + ne; 
        if(mi>pen){mi = pen; c=i;}
    }
    int res = 0; //cout << "c:" << c << endl;
    for(int i=0; i<n; ++i){
        if(s[i]=='W' && i<c){res++;}
        if(s[i]=='E' && i>c){res++;}
    }
    cout << res << endl;
    return 0;
}