int[] hidari, migi;

void main() {
	auto N = ri;
	auto S = rs;
	ulong res = ulong.max;
	hidari = new int[](N);
	migi = new int[](N);
	if(S[0] == 'W') hidari[0] = 1;
	else migi[0] = 1;
	foreach(i; 1..N) if(S[i] == 'W') {
		hidari[i] = hidari[i-1] + 1;
		migi[i] = migi[i-1];
	} else {
		hidari[i] = hidari[i-1];
		migi[i] = migi[i-1] + 1;
	}
	debug hidari.writeln;
	debug migi.writeln;
	auto L = hidari[$-1];
	auto R = migi[$-1];
	res = (S[0] == 'E') && (S[0] != S[1]) ? L-1 : L;
	//res.writeln;
	foreach(i; 1..N-1) {
		ulong tmp;
		if(hidari[i] == hidari[i-1]) {
			tmp += hidari[i];
		} else tmp += hidari[i] - 1;
		if(migi[i] == migi[i+1]) {
			tmp += R-migi[i];
		} else tmp += R-migi[i] - 1;
		debug tmp.writeln;
		res = min(res, tmp);
	}
	res = min(res, S[$-1] == 'W' ? R-1 : R);
	//((S[$-1] == 'W') && (S[$-1] != S[$-2]) ? R-1 : R).writeln;
	res.writeln;
}

// ===================================

import std.stdio;
import std.string;
import std.conv;
import std.algorithm;
import std.range;
import std.traits;
import std.math;
import std.container;
import std.bigint;
import std.numeric;
import std.conv;
import std.typecons;
import std.uni;
import std.ascii;
import std.bitmanip;
import core.bitop;

T readAs(T)() if (isBasicType!T) {
	return readln.chomp.to!T;
}
T readAs(T)() if (isArray!T) {
	return readln.split.to!T;
}

T[][] readMatrix(T)(uint height, uint width) if (!isSomeChar!T) {
	auto res = new T[][](height, width);
	foreach(i; 0..height) {
		res[i] = readAs!(T[]);
	}
	return res;
}

T[][] readMatrix(T)(uint height, uint width) if (isSomeChar!T) {
	auto res = new T[][](height, width);
	foreach(i; 0..height) {
		auto s = rs;
		foreach(j; 0..width) res[i][j] = s[j].to!T;
	}
	return res;
}

int ri() {
	return readAs!int;
}

double rd() {
	return readAs!double;
}

string rs() {
	return readln.chomp;
}