There are N people standing in a row from west to east. Each person is facing east or west. The directions of the people is given as a string S of length N. The i-th person from the west is facing east if S_i = `E`, and west if S_i = `W`.  You will appoint one of the N people as the leader, then command the rest of them to face in the direction of the leader. Here, we do not care which direction the leader is facing.  The people in the row hate to change their directions, so you would like to select the leader so that the number of people who have to change their directions is minimized. Find the minimum number of people who have to change their directions.
N=int(input())
A=input()
R=[0]
for i in range(N):
    R.append(R[i]+(A[i]=="W"))
min([R[i]+(N-i-1)-(R[-1]-R[i+1]) for i in range(N)])
N=int(input())
A=input()
R=[0]
for i in range(N):
    R.append(R[i]+(A[i]=="W"))
print(min([R[i]+(N-i-1)-(R[-1]-R[i+1]) for i in range(N)]))