/Merge-Sort

Merge sort is an efficient, general-purpose, comparison-based, divide and conquer sorting algorithm.

Primary LanguageC++

Merge Sort

Author: @037

Compile

sudo g++ -std=c++11 -o MergeSort.exe MergeSort.cpp

Input structure

The input starts with an integer number which indicates the number of elements, n. Then, the elements follow, one per line.

Output structure

Output the elements in non-decreasing order. Each element must be followed by ;.

Example

Input

6
5
3
2
1
6
4

Output

1;2;3;4;5;6;