Imagine you are a merchant having $n$ spice boxes. The weight $i^{th}$ spice box is $w_i$. You can sell only spice sets having total weight 250g. So you need to make 3 groups of spice boxes such that each group has total weight 250g and no spice box is left ungrouped.
You need to determine whether it's possible or not. If possible you need to output the groups.

The first line of input contains $n$ the number of spice boxes. The second line contains $n$ integers $w_{1}$ $w_{2}$ $w_{3}$ .... $w_{n}$, denoting the weights of the spice boxes.

You need to output "YES" or "NO" (without quotes and capitalized) denoting whether it's possible or not to make such groups.
If Yes then you need to output the groups in three lines, each line should contain the weights of the spice box present in the group.

($1 \le n \le 10$).
($1 \le w_{i} \le 250$)