{"trustable":false,"sections":[{"title":"","value":{"format":"MD","content":"Another tale of lumberjacks?. Let see . . .\nThe lumberjacks are rude, bearded workers, while foremen tend to be bossy and simpleminded.\nThe foremen like to harass the lumberjacks by making them line up in groups of ten, ordered by the\nlength of their beards. The lumberjacks, being of different physical heights, vary their arrangements to\nconfuse the foremen. Therefore, the foremen must actually measure the beards in centimeters to see if\neveryone is lined up in order.\nYour task is to write a program to assist the foremen in determining whether or not the lumberjacks\nare lined up properly, either from shortest to longest beard or from longest to shortest."}},{"title":"Input","value":{"format":"MD","content":"The input starts with line containing a single integer N, 0 \u003c N \u003c 20, which is the number of groups\nto process. Following this are N lines, each containing ten distinct positive integers less than 100.\n"}},{"title":"Output","value":{"format":"MD","content":"There is a title line, then one line per set of beard lengths. See the sample output for capitalization\nand punctuation.\n"}},{"title":"Sample Input","value":{"format":"MD","content":"3\n13 25 39 40 55 62 68 77 88 95\n88 62 77 20 40 10 99 56 45 36\n91 78 61 59 54 49 43 33 26 18\n"}},{"title":"Sample Output","value":{"format":"MD","content":"Lumberjacks:\nOrdered\nUnordered\nOrdered"}}]}