#include<bits/stdc++.h>
using namespace std;

int main(void){
   int N;
   cin>>N;
   vector<char> S(N);
   for(int i=0;i<N;i++){
      cin>>S[i];
   }
   int ans=0;
   vector<int> E(N+1);
   vector<int> W(N+1);
   E[0]=0;
   W[0]=0;
   for(int i=0;i<N;i++){
      if(S[i]=='E'){
         E[i+1]=E[i]+1;
      }else{
         E[i+1]=E[i];
      }
      if(S[i]=='W'){
         W[i+1]=W[i]+1;
      }else{
         W[i+1]=W[i];
      }
   }
   ans=N;
   for(int i=0;i<N;i++){
      int result=W[i+1]+E[N]-E[i]-1;
      ans=min(result,ans);
   }
   cout<<ans<<endl;
   return 0;
}
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a first
#define b second
#define sz(x) (ll)((x).size())
#define pb push_back
#define mp make_pair
#define bg begin()
#define ed end()
#define all(x) (x).bg,(x).ed
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rep1(i,n) for(ll i=1;i<=(n);i++)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(ll i=(n);i>=1;i--)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
const ll MOD=1000000007;
const ll INF=1000000000000000;
template<class T> inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if(a<b){a=b;return true;}return false;}
ll maxx(ll x,ll y,ll z){return max(max(x,y),z);}
ll minn(ll x,ll y,ll z){return min(min(x,y),z);}
ll gcd(ll x,ll y){if(x%y==0) return y;else return gcd(y,x%y);}
ll lcm(ll x,ll y){return x*(y/gcd(x,y));}
ll digsz(ll x){if(x==0) return 1;else{ll ans=0;while(x){x/=10;ans++;}return ans;}}
ll digsum(ll x){ll sum=0;while(x){sum+=x%10;x/=10;}return sum;}
vector<ll> pw2(62,1);vector<ll> pw10(19,1);

int main(){
    {rep1(i,61) pw2[i]=2*pw2[i-1];}
    {rep1(i,18) pw10[i]=10*pw10[i-1];}
    
    ll N; cin>>N;
    ll cnt=0,ans=INF;
    string s; cin>>s;
    
    //EEEEEEEEEEEEEEEEE
    rep(i,sz(s)){
        if(s[i]=='W') cnt++;
    }
    ans=cnt;
    
    rrep(i,sz(s)){
        if(s[i]=='W') cnt--;
        else cnt++;
        chmin(ans,cnt);
    }
    
    cout<<ans<<endl;
}

