CF1622F.Quadratic Set

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Let's call a set of positive integers a1,a2,,aka_1, a_2, \dots, a_k quadratic if the product of the factorials of its elements is a square of an integer, i. e. i=1kai!=m2\prod\limits_{i=1}^{k} a_i! = m^2 , for some integer mm .

You are given a positive integer nn .

Your task is to find a quadratic subset of a set 1,2,,n1, 2, \dots, n of maximum size. If there are multiple answers, print any of them.

输入格式

A single line contains a single integer nn ( 1n1061 \le n \le 10^6 ).

输出格式

In the first line, print a single integer — the size of the maximum subset. In the second line, print the subset itself in an arbitrary order.

输入输出样例

  • 输入#1

    1

    输出#1

    1
    1
  • 输入#2

    4

    输出#2

    3
    1 3 4
  • 输入#3

    7

    输出#3

    4
    1 4 5 6
  • 输入#4

    9

    输出#4

    7
    1 2 4 5 6 7 9
首页