#include <stdio.h>
#include <stdlib.h>
sort( n, input[], (n <= || input == printf(
(i = ; i < n - ; i++ (j = ; j < n - - i; j++ (input[j] < input[j + k = input[j + input[j + ] = input[j] =
(n % == j = (n - ) / + (n % == j = (n + ) / -
(i = ; i < n; i++ (i % == j += (i % == j -= output[j] =
n = i = input_flag = MAX = ^ ( * () - printf( scanf(, &
*input = ( *)malloc(n * ( *output = ( *)malloc(n * ( printf( (i = ; i < n; i++ scanf(, & (input[i] > MAX || input[i] < ( - MAX - printf(
printf( (i = ; i < n; i++ printf( printf(
