output_description: Print the minimum number of people who have to change their directions.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      S
attempt: def foo (s):
      ans = 0
      count = 0
      for i in s:
          if i == 'W':
          count += 1
      elif count :
          count -= 1
          ans += 1
      else:
          pass
      return ans
  
  n = input()
  s = input()
   
  print(foo(s))
problem_description: Statement
  
  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.
samples: [{"input": "5\n    WEEWW", "output": "1\n    \n\nAssume that we appoint the third person from the west as the leader. Then, the\nfirst person from the west needs to face east and has to turn around. The\nother people do not need to change their directions, so the number of people\nwho have to change their directions is 1 in this case. It is not possible to\nhave 0 people who have to change their directions, so the answer is 1.\n\n* * *"}, {"input": "12\n    WEWEWEEEWWWE", "output": "4\n    \n\n* * *"}, {"input": "8\n    WWWWWEEE", "output": "3"}]