#D11809. String Set
String Set
String Set
Problem statement
Of the string set that meets the following conditions, configure with the largest number of elements.
- The length of the string contained in is or more and or less.
- The lengths of the strings contained in are different.
- The string contained in consists only of the characters
0
and1
. - For any string contained in , one is not a substring of the other.
However, the substring of the string is the string obtained by removing more than characters from the beginning and end of .
Constraint
- is an integer
input
Input is given from standard input in the following format.
output
Output of the string set that satisfies the condition with the maximum number of elements. There may be multiple such , but any output will be correct.
Specifically, output in the following format.
Output , the number of elements of , on the line.
Output all elements from the line to the line. Print of elements on each line.
Input example 1
2
Output example 1
2 0 11
The string set is the set with the largest number of elements that meets the conditions.
Input example 2
1
Output example 2
1 0
Example
Input
2
Output
2 0 11
inputFormat
input
Input is given from standard input in the following format.
outputFormat
output
Output of the string set that satisfies the condition with the maximum number of elements. There may be multiple such , but any output will be correct.
Specifically, output in the following format.
Output , the number of elements of , on the line.
Output all elements from the line to the line. Print of elements on each line.
Input example 1
2
Output example 1
2 0 11
The string set is the set with the largest number of elements that meets the conditions.
Input example 2
1
Output example 2
1 0
Example
Input
2
Output
2 0 11
样例
2
2
0
11
</p>