Problem Statement  
As a finance minister, Bob decided to make new denominations of coins. If the values of the coins are x_{1}, x_{2}, x_{3}, ... in ascending order then x_{1} must be 1 and x_{b} must be an integer multiple of x_{a} for all b > a.
He has a list of products sold in his country. The price of the ith product is price[i]. He wants to minimize the number of coins required to buy each product exactly once. Each product must be purchased separately using coins that total to exactly the value of the product. Using multiple coins of the same denomination is allowed. See example 0 for further clarification. Return the minimal number of coins required to buy each product exactly once.  
Definition  
 
Constraints  
  price will contain between 1 and 50 elements, inclusive.  
  Each element in price will be between 1 and 100,000, inclusive.  
Examples  
0)  
 
1)  
 
2)  
 
3)  
 
4)  
