User ainta loves to play with cards. He has *a* cards containing letter "o" and *b* cards containing letter "x". He arranges the cards in a row, and calculates the score of the deck by the formula below.
 1.  At first, the score is 0. 1.  For each block of contiguous "o"s with length *x* the score increases by *x*<sup class="upper-index">2</sup>. 1.  For each block of contiguous "x"s with length *y* the score decreases by *y*<sup class="upper-index">2</sup>. 
For example, if *a* = 6, *b* = 3 and ainta have arranged the cards in the order, that is described by string "ooxoooxxo", the score of the deck equals 2<sup class="upper-index">2</sup> - 1<sup class="upper-index">2</sup> + 3<sup class="upper-index">2</sup> - 2<sup class="upper-index">2</sup> + 1<sup class="upper-index">2</sup> = 9. That is because the deck has 5 blocks in total: "oo", "x", "ooo", "xx", "o".

User ainta likes big numbers, so he wants to maximize the score with the given cards. Help ainta make the score as big as possible. Note, that he has to arrange all his cards.
The first line contains two space-separated integers *a* and *b* (0 ≤ *a*, *b* ≤ 10<sup class="upper-index">5</sup>; *a* + *b* ≥ 1) — the number of "o" cards and the number of "x" cards.
class CodeforcesTask398ASolution:
    def __init__(self):
        self.result = ''
        self.a_b = []

    def read_input(self):
        self.a_b = [int(x) for x in input().split(" ")]

    def process_task(self):
        if self.a_b[0] ** 2 >=  2 * ((self.a_b[1] // 2) ** 2):
            score = self.a_b[0] ** 2
            if self.a_b[1] % 2:
                score -= ((self.a_b[1] - 1) // 2) ** 2 + ((self.a_b[1] - 1) // 2 + 1) ** 2
                deck = "x" * ((self.a_b[1] - 1) // 2) + "o" * self.a_b[0] + "x" * ((self.a_b[1] - 1) // 2 + 1)
            else:
                score -= ((self.a_b[1]) // 2) ** 2 + ((self.a_b[1]) // 2) ** 2
                deck = "x" * ((self.a_b[1]) // 2) + "o" * self.a_b[0] + "x" * ((self.a_b[1]) // 2)
            self.result = "{0}\n{1}".format(score, deck)
        else:
            if self.a_b[0]:
                division = self.a_b[0] + 1
                score = self.a_b[0] - (division - 1) * ((self.a_b[1] // division) ** 2) - (self.a_b[1] // division + self.a_b[1] % division) ** 2
                step = "x" * (self.a_b[1] // division) + "o"
                deck = step * (division - 1) + "x" * (self.a_b[1] % self.a_b[0])
                self.result = "{0}\n{1}".format(score, deck)
            else:
                score = - self.a_b[1] ** 2
                self.result = "{0}\n{1}".format(score, "x" * self.a_b[1])

    def get_result(self):
        return self.result


if __name__ == "__main__":
    Solution = CodeforcesTask398ASolution()
    Solution.read_input()
    Solution.process_task()
    print(Solution.get_result())
