// #define _CRT_SECURE_NO_WARNINGS
// #define _USE_MATH_DEFINES	// M_PI=3.1415...
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <locale>
#include <cctype>
#include <sstream>
#include <iomanip>	// 20桁出力 cout << setprecision(20) << double;
#include <queue>
#include <bitset>	// bitset<8> bs1(131uL); // 10000011 bs1[0]は1 01stringからビット集合生成可
#include <numeric>
#include <random>
#include <climits>  // A/Bを計算するときA==LLONG_MIN && B==-1のみ(1ull<<63)で代用
using namespace std;

typedef long long LL;
typedef pair<LL, LL> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<LL> VL;
typedef vector<VL> VVL;				// VVL v(100,VL(100,0));
typedef vector<pair<LL, LL> > VP;
typedef vector<string> VS;
typedef map<int, int> MAPII;
typedef multimap<int, char, greater<int> > MuMAPIC;
typedef multimap<int, string, greater<int> > MuMIS;
typedef pair<LL, pair<P, P> > PP;

#define INF 999999999999999997		// 少し加算したらオーバーフローする
#define MP make_pair
#define FAST_IO  cin.tie(0); ios::sync_with_stdio(false);
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define FORL(i,a,b) for(LL i=(a);i<(b);i++)
#define FOR_REV(i,a,b) for(int i=(a);i>=(b);i--)
#define foreach_it(type,it,c) for(type::iterator it=c.begin(),c_end=c.end();it!=c_end;++it)
#define FOR_ITR(d) for(auto itr=d.begin(),d_end=d.end();itr!=d_end;++itr)	// C++11
#define O(s) cout<<s<<endl;

#define DUMP_VVI(b) if(dbgF){FOR(i,0,b.size()){FOR(j,0,b[i].size())printf("%d ",b[i][j]);puts("");}}
#define D_OUT(str,value) if(dbgF){cout<<str<<" : "<<value<<endl;}

template<class T>T IN() { T d; cin >> d; return d; }

LL gcd(LL a, LL b) { return (b > 0) ? gcd(b, a%b) : a; } // 最大公約数（Greatest Common Divisor）
LL lcm(LL a, LL b) { return a / gcd(a, b) * b; } // 最小公倍数（Least Common Multiple）
bool uruu(LL Y) { return (((Y % 4 == 0 && Y % 100 != 0) || Y % 400 == 0) ? true : false); } // うるう年判定
string Replace(string S, string from, string to) { auto p = S.find(from); while (p != string::npos) { S.replace(p, from.size(), to); p = S.find(from, p + to.size()); }return S; }

int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
int dxx[8] = { 0,1,1,1,0,-1,-1,-1 };
int dyy[8] = { 1,1,0,-1,-1,-1,0,1 };

// -------------------------------------------------------------------------------

int main() {
	FAST_IO;
	bool dbgF = true; // for D_OUT(str, value)  ... cout<< str <<" : "<< value <<endl;

	LL N;
	string S;
	cin >> N >> S;
	LL ans = 999999999;
	VL W_left_sum(N, 0), E_left_sum(N, 0), W_right_sum(N, 0), E_right_sum(N, 0);


	FOR(i, 0, N) {
		// left start
		if (S[i] == 'W') {
			if (i == 0) {
				W_left_sum[i] = 1;
			}
			else {
				W_left_sum[i] = W_left_sum[i - 1] + 1;
			}
		}
		else {
			if (i == 0) {
				E_left_sum[i] = 1;
			}
			else {
				E_left_sum[i] = E_left_sum[i - 1] + 1;
			}
		}
		// right start
		if (S[N - i - 1] == 'W') {
			if (i == 0) {
				W_right_sum[0] = 1;
			}
			else {
				W_right_sum[i] = W_right_sum[i - 1] + 1;
			}
		}
		else {
			if (N - i == N) {
				E_right_sum[0] = 1;
			}
			else {
				E_right_sum[i] = E_right_sum[i - 1] + 1;
			}
		}
		if (i != 0) {
			if (W_left_sum[i] == 0)W_left_sum[i] = W_left_sum[i - 1];
			if (E_left_sum[i] == 0)E_left_sum[i] = E_left_sum[i - 1];
			if (W_right_sum[i] == 0)W_right_sum[i] = W_right_sum[i - 1];
			if (E_right_sum[i] == 0)E_right_sum[i] = E_right_sum[i - 1];
		}
	}
	/*FOR(i, 0, N) {
		cout << W_left_sum[i] << " " << E_left_sum[i] << ", " << W_right_sum[i] << " " << E_right_sum[i] << endl;
	}*/

	FOR(i, 0, N) {
		LL nowcount = 0;
		// left Eを向くべき
		if (i != 0)nowcount += W_left_sum[i - 1];
		// right Wを向くべき
		if (i != N - 1)nowcount += E_right_sum[N - i - 2];

		//cout << "nowcount = " << nowcount << endl;
		ans = min(ans, nowcount);
	}
	O(ans);

	return 0;
}

Measured memory_bytes: 10004