#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
/*
//#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
*/

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
/*
//#if __cplusplus >= 201103L
#include <array>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
*/
using namespace std;
#define fi first
#define se second
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb(s) push_back(s)
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define mp(a,b) make_pair(a,b)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl

#define uni(x) x.erase(unique(all(x)),x.end())
template<class T,class U>inline void chmin(T &t,U f){if(t>f)t=f;}
template<class T,class U>inline void chmax(T &t,U f){if(t<f)t=f;}
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) > (b) ? (b) : (a))

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<P, int> PPI;

#define INF INT_MAX/3
#define MAX_N 1000
#define M_INF 1000000000
int n,m,v,i;
string s;
void solve(){
   cin.tie(0);
  ios::sync_with_stdio(false);
  cin>>n>>s;
  ll cnt = 0,p = n;
  rep(i,n) if(s[i]=='W') cnt++;
  p-=cnt;
  ll W[n+1],E[n+1];
  rep(i,n) W[i] = 0;
  rep(i,n) E[i] = 0;
  // memset(W,0,sizeof(W));
  // memset(E,0,sizeof(E));
  if(s[0]=='W') cnt--;
  W[0] = cnt;
  E[0] = 0;
  repl(i,1,n){
    if(s[i]=='W') {
      W[i] = W[i-1] - 1;
    } else {
      W[i] = W[i-1];
    }
  }
  if(s[n-1]=='E') p--;
  E[n-1] = p;
  for(int i = n-2;i>-1;i--){
    if(s[i]=='E') {
      E[i] = E[i+1] - 1;
    } else {
      E[i] = E[i+1];
    }
  }
  ll mx = 0;
  rep(i,n) {
    maxch(mx,W[i]+E[i]);
    // cout<<W[i]<<" "<<E[i]<<endl;
    // cout<<mx<<endl;
  }
  // maxch(mx,W[0]+E[0]+1);
  // maxch(mx,W[n-1]+E[n-1]+1);
  cout<<n-mx-1<<endl;

}

int main(){
  solve();
  return 0;
}


Measured memory_bytes: 5396