Intelligent Warehouse
题号:NC211807
时间限制:C/C++/Rust/Pascal 1秒,其他语言2秒
空间限制:C/C++/Rust/Pascal 256 M,其他语言512 M
64bit IO Format: %lld

题目描述

In MI Intelligent Warehouse, there are products, where the -th product is of size 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 is multiple of a_j or a_j is multiple of a_i. Print the maximum number of products that can be chosen in one boxing.

输入描述:

The first line contains one integer .

The second line contains integers .

输出描述:

Only one line containing one integer, denoting the maximum number of products we can choose in one boxing.
示例1

输入

复制
6
1 4 2 8 5 7

输出

复制
4

说明

One possible choice is {1, 4, 2, 8}.