For each case, the first line of the input contains an integer number N representing the quantity of numbers in this array(1≤N≤1000). Next N lines contain N integer numbers(one number per each line) of the original array.
You are given an unsorted array of integer numbers. Your task is to sort this array and kill possible duplicated elements occurring in it.
6 8 8 7 3 7 7
3 7 8