void main() {
	auto N = ri;
	auto S = rs;
	auto earr = new int[](N);
	earr[0] = (S[0] == 'E' ? 1 : 0);
	foreach(i; 0..N-1) earr[i+1] = earr[i] + (S[i+1] == 'E' ? 1 : 0);

	int res = int.max;
	foreach(k; 0..N) {
		int a, b;
		if(k != 0) a = (k - earr[k-1]);
		if(k != N-1) b = earr[$-1] - earr[k+1];
		res = min(res, a+b);
	}
	res.writeln;
}

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

import std.stdio;
import std.string;
import std.functional;
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;
}