## DMOPC '21 Contest 3 P2 - Weak Data

View as PDF

Points: 10 (partial)
Time limit: 2.0s
Memory limit: 256M

Author:
Problem type

You are generating data for the second problem of the DMOPC, which reads as follows:

Given an integer array of length with elements in the range , output the number of non-empty contiguous subarrays with an even sum.

Just as you were about to wrap up the last batch of cases, you open Discord to see 8 pings from Keenan, who insists that the data is weak unless there is a test case where the expected output is . As it is only a few hours before the actual contest, there's no time for you to create such a case by hand. Please write a program to find a case satisfying Keenan's requirement, or determine that his requirement is impossible to satisfy (under the given constraints of the problem).

#### Input Specification

The first and only line will contain the integer .

#### Output Specification

If it is impossible to satisfy Keenan's requirement under the constraints of the problem, output .

Otherwise, output on the first line, representing the length of the array.

Then, on the second line, output integers , representing an array of length that satisfies Keenan's requirement.

If there are multiple arrays satisfying Keenan's requirement, output any one of them.

#### Sample Input 1

7

#### Sample Output 1

5
5 4 9 1 6

#### Explanation for Sample 1

The subarrays with even sum are: .

#### Sample Input 2

1000000000000000000

#### Sample Output 2

-1