Score : 1000 points
We will call a string x good if it satisfies the following condition:
For example, aa
and bubobubo
are good; an empty string, a
, abcabcabc
and abba
are not good.
Eagle and Owl created a puzzle on good strings. Find one string s that satisfies the following conditions. It can be proved that such a string always exists under the constraints in this problem.
Input is given from Standard Input in the following format:
N
In the first line, print |s|, the length of s. In the second line, print the elements in s in order, with spaces in between. Any string that satisfies the above conditions will be accepted.
7
4 1 1 1 1
There are two good strings that appear as subsequences of s: (1,1) and (1,1,1,1). There are six occurrences of (1,1) and one occurrence of (1,1,1,1), for a total of seven.
299
23 32 11 11 73 45 8 11 83 83 8 45 32 32 10 100 73 32 83 45 73 32 11 10