. We always need to box producsts into all kinds of containers, and it will be safer and more cost efficient if for any two sizes of products, one is the other's multiple, since there won't be any residual room in one container. So for each boxing we need to choose some products that for any two chosen products, either. . Print the maximum number of products that can be chosen in one boxing.
In MI Intelligent Warehouse, there are n_{} n products, where the i_{} i -th product is of size a_i a i . We always need to box producsts into all kinds of containers, and it will be safer and more cost efficient if for any two sizes of products, one is the other's multiple, since there won't be any residual room in one container. So for each boxing we need to choose some products that for any two chosen products, either a_i a i is multiple of a_j a j or a_j a j is multiple of a_i a i . Print the maximum number of products that can be chosen in one boxing.