Problem Statement  
Given a positive integer n, you are to find the largest subset S of {1,...,n} such that no member of S is divisible by another member of S. If there is more than one subset of the maximum size, choose the lexicographically earliest such subset. A subset S is lexicographically earlier than a subset T if the smallest element that is a member of one of the subsets, but not both, is a member of S. Return the subset S as a int[] in increasing order.  
Definition  
 
Constraints  
  n is between 1 and 1000, inclusive.  
Examples  
0)  
 
1)  
 
2)  
 
3)  
