A long time ago, in a certain Dmojistan far far away, there existed a small DMOPC committee of people. One fateful day, when the members were sitting in a circle (with the -th member sitting next to the -th for all and the -th member sitting next to the first) discussing new problem ideas, an evil witch appeared and stated the following: "Look to your left and to your right. By the beginning of next year, at least one of those people will be gone". Terrified about the legitimacy of her statement, the DMOPC committee banded together and wondered: if what the witch said was true, at most how many members will remain in the committee next year? Your job is to answer this question and provide an example of an optimal scenario.
Subtask 1 [20%]
Subtask 2 [80%]
No additional constraints.
The first and only line contains a single integer .
On the first line output an integer , representing the maximum number of people that can remain in the committee next year.
On the second line output a string of length consisting of the characters
M. This string should represent an optimal scenario in which the members used to sit in a circle and people remain in the committee. Specifically, the -th character of the string should be
M if the -th member stays, or
_ if they leave. Each index should have at least one character
_ next to it, and there should be exactly character
Ms in the string. If there exist multiple optimal scenarios, output any one of them.
For each test case:
If the integer you output is not maximal, your score will be and you will receive a
Wrong Answer verdict.
If the integer you output is maximal but your configuration is invalid or missing, you will receive points.
Otherwise, you will receive points.
Your score for a subtask will be the minimum score over all test cases in the subtask multiplied by the weight of the subtask.
Your final score will be the sum of the scores of all the subtasks.