output_description: Print the number of the possible colors of the last remaining creature after
  the N creatures repeatedly merge and ultimately become one creature.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      N
      A_1 A_2 … A_N
attempt: 5
  1 1 1 1 1
problem_description: Statement
  
  Snuke found N strange creatures. Each creature has a fixed color and size. The
  color and size of the i-th creature are represented by i and A_i,
  respectively.
  
  Every creature can absorb another creature whose size is at most twice the
  size of itself. When a creature of size A and color B absorbs another creature
  of size C and color D (C \leq 2 \times A), they will merge into one creature
  of size A+C and color B. Here, depending on the sizes of two creatures, it is
  possible that both of them can absorb the other.
  
  Snuke has been watching these creatures merge over and over and ultimately
  become one creature. Find the number of the possible colors of this creature.
samples: [{"input": "3\n    3 1 4", "output": "2\n    \n\nThe possible colors of the last remaining creature are colors 1 and 3. For\nexample, when the creature of color 3 absorbs the creature of color 2, then\nthe creature of color 1 absorbs the creature of color 3, the color of the last\nremaining creature will be color 1.\n\n* * *"}, {"input": "5\n    1 1 1 1 1", "output": "5\n    \n\nThere may be multiple creatures of the same size.\n\n* * *"}, {"input": "6\n    40 1 30 2 7 20", "output": "4"}]