|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|2 초||256 MB||1||1||1||100.000%|
You're going to launch a new online game that everybody will want to play. However, your servers are not ready to handle so many players. More precisely, your servers can handle $n$ players. Of course, you want as many players as possible, as that gives you as much income as possible. In other words, your goal is to have exactly $n$ players.
Acknowledging the state of your servers publicly would mean bad PR for your company. So you've decided the limit the number of players in a different way: by limiting their choice for usernames in such a way that there are exactly $n$ valid usernames.
The allowed usernames are strings that:
You need to choose $k$, $m$, and the strings $s_1, s_2, \dots, s_m$ in such a way that there exist exactly $n$ valid usernames. See the output format for the restrictions on the values you choose.
The only line of the input file contains one integer $n$, $1 \le n \le 10^9$.
On the first line of the output file, print two integers $k$ and $m$: the length of the usernames, and the number of forbidden substrings. On the next $m$ lines print the forbidden substrings.
It is guaranteed that a solution will always exist. You may output any valid solution. Forbidden substrings may coincide or be substrings of one another.
3 1 BB
3 2 ABB BBB