CodeForces347B

You want to arrange n integers a1, a2, …, an in some order in a row. Let’s define the value of an arrangement as the sum of differences between all pairs of adjacent integers.

More formally, let’s denote some arrangement as a sequence of integers x1, x2, …, xn, where sequence x is a permutation of sequence a. The value of such an arrangement is (x1 - x2) + (x2 - x3) + … + (xn - 1 - xn).

Find the largest possible value of an arrangement. Then, output the lexicographically smallest sequence x that corresponds to an arrangement of the largest possible value.

Input
The first line of the input contains integer n (2 ≤ n ≤ 100). The second line contains n space-separated integers a1, a2, …, an (|ai| ≤ 1000).

Output
Print the required sequence x1, x2, …, xn. Sequence x should be the lexicographically smallest permutation of a that corresponds to an arrangement of the largest possible value.

Example
Input
5
100 -100 50 0 -50
Output
100 -50 0 50 -100
Note
In the sample test case, the value of the output arrangement is (100 - ( - 50)) + (( - 50) - 0) + (0 - 50) + (50 - ( - 100)) = 200. No other arrangement has a larger value, and among all arrangements with the value of 200, the output arrangement is the lexicographically smallest one.

Sequence x1, x2, … , xp is lexicographically smaller than sequence y1, y2, … , yp if there exists an integer r (0 ≤ r < p) such that x1 = y1, x2 = y2, … , xr = yr and xr + 1 < yr + 1.

import java.util.ArrayList;
import java.util.HashMap;
import java.util.Scanner;

/**
 * Created by 95112 on 10/22/2017.
 */
public class Permutation {
    public static void main(String[] args)
    {
        Scanner scanner = new Scanner(System.in);
        int n  = scanner.nextInt();
        int[] input = new int[n];
        HashMap<Integer,Integer> storage = new HashMap();
        for (int i = 0 ; i < n ; i++)
        {
            input[i] = scanner.nextInt();
            if (!storage.containsKey(input[i]))
                storage.put(input[i],i);
        }
        int count = 0;
        int key = 1;
        for (int i = 0 ;i < n ; i++)
        {
            if (input[i] == i)
                count++;
            else {
                if (storage.containsKey(i) && storage.get(i) == input[i] && key ==1){
                    count++;
                    count++;
                    key--;
                }
            }
        }
        if (key == 1 && count < n){
            count++;
        }

        System.out.println(count);
    }

}