AT_arc198_a [ARC198A] I hate 1

You are given a positive integer $ N $ . A set $ S $ of positive integers between $ 1 $ and $ N $ (inclusive) is called a **good set** if it satisfies the following condition: - For every pair of elements $ x $ and $ y $ in $ S $ , the remainder when $ x $ is divided by $ y $ is not $ 1 $ . Construct one good set with the maximum possible number of elements.

The input is given from Standard Input in the following format: > $ N $

Let $ k $ be the number of elements of the good set $ S $ you constructed, and let $ S = \lbrace S_1,S_2,\dots,S_k \rbrace $ be its elements. Output in the following format: > $ k $ $ S_1\ S_2\ \dots\ S_k $ If multiple solutions exist, any of them will be accepted.

### Sample Explanation 1 For example, $ \lbrace 3,5 \rbrace $ and $ \lbrace 2 \rbrace $ are good sets. On the other hand, $ \lbrace 2,3,5 \rbrace $ and $ \lbrace 1,2,3,4,5 \rbrace $ are not good sets. No good set with three or more elements exists, so $ \lbrace 3,5 \rbrace $ is one of the good sets with the maximum number of elements. ### Constraints - $ 1 \le N \le 2 \times 10^{5} $