Hamming distance between strings a and b of equal length (denoted by h(a, b)) is equal to the number of distinct integers i (1 ≤ i ≤ |a|), such that a_i ≠ b_i, where a_i is the i-th symbol of string a, b_i is the i-th symbol of string b. For example, the Hamming distance between strings "aba" and "bba" equals 1, they have different first symbols. For strings "bbba" and "aaab" the Hamming distance equals 4.

John Doe had a paper on which four strings of equal length s₁, s₂, s₃ and s₄ were written. Each string s_i consisted only of lowercase letters "a" and "b". John found the Hamming distances between all pairs of strings he had. Then he lost the paper with the strings but he didn't lose the Hamming distances between all pairs.

Help John restore the strings; find some four strings s'₁, s'₂, s'₃, s'₄ of equal length that consist only of lowercase letters "a" and "b", such that the pairwise Hamming distances between them are the same as between John's strings. More formally, set s'_i must satisfy the condition .

To make the strings easier to put down on a piece of paper, you should choose among all suitable sets of strings the one that has strings of minimum length.

The first line contains space-separated integers h(s₁, s₂), h(s₁, s₃), h(s₁, s₄). The second line contains space-separated integers h(s₂, s₃) and h(s₂, s₄). The third line contains the single integer h(s₃, s₄).

All given integers h(s_i, s_j) are non-negative and do not exceed 10⁵. It is guaranteed that at least one number h(s_i, s_j) is positive.

Print -1 if there's no suitable set of strings.

Otherwise print on the first line number len — the length of each string. On the i-th of the next four lines print string s'_i. If there are multiple sets with the minimum length of the strings, print any of them.