input: 
  def match_parens(lst):
      '''
      You are given a list of two strings, both strings consist of open
      parentheses '(' or close parentheses ')' only.
      Your job is to check if it is possible to concatenate the two strings in
      some order, that the resulting string will be good.
      A string S is considered to be good if and only if all parentheses in S
      are balanced. For example: the string '(())()' is good, while the string
      '())' is not.
      Return 'Yes' if there's a way to make a good string, and return 'No' otherwise.
  
      Examples:
      match_parens(['()(', ')']) == 'Yes'
      match_parens([')', ')']) == 'No'
      '''
  
output:     count_open_1 = lst[0].count('(')
      count_close_1 = lst[0].count(')')
      count_open_2 = lst[1].count('(')
      count_close_2 = lst[1].count(')')
      
      total_open = count_open_1 + count_open_2
      total_close = count_close_1 + count_close_2
      
      if total_open == total_close:
          return 'Yes'
      else:
          return 'No'