Shopping Mall Coupon Interleaving

Problem Statement

A shopping mall distributes coupons to its customers every day during the festival season. To choose the lucky winner, the mall's application generated a list of lucky coupon numbers of N customers. To select the lucky customers, the application combined the first half of the list with the second half of the list by combining alternate elements, while maintaining the relative positions of the elements of the list. Write an algorithm for the mall application to combine the given list in the above-stated format. Input The first line of the input consists of an integer - couponNumber_size , representing the total number of coupons (N). The second line of input consists of N space-separated integers - couponNumber 1 , couponNumber 2 , ....., couponNumber N representing the lucky coupon numbers of N customers. Output Print N space-separated integers representing the final combined list. If the output is not possible then print an empty list. Constraints 2 ≤ couponNumber_size ≤ 5000 Note The