Codeforces Round #364 (Div. 2) A 水

A. Cards

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

There are n cards (n is even) in the deck. Each card has a positive integer written on it. n / 2 people will play new card game. At the beginning of the game each player gets two cards, each card is given to exactly one player.

Find the way to distribute cards such that the sum of values written of the cards will be equal for each player. It is guaranteed that it is always possible.

Input

The first line of the input contains integer n (2 ≤ n ≤ 100) — the number of cards in the deck. It is guaranteed that n is even.

The second line contains the sequence of n positive integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 100), where a_i is equal to the number written on the i-th card.

Output

Print n / 2 pairs of integers, the i-th pair denote the cards that should be given to the i-th player. Each card should be given to exactly one player. Cards are numbered in the order they appear in the input.

It is guaranteed that solution exists. If there are several correct answers, you are allowed to print any of them.

Examples

Input

6
1 5 7 4 4 3

Output

1 3
6 2
4 5

Input

4
10 10 10 10

Output

1 2
3 4

Note

In the first sample, cards are distributed in such a way that each player has the sum of numbers written on his cards equal to 8.

In the second sample, all values a_i are equal. Thus, any distribution is acceptable.

题意：n个数 （n为偶数） 两个配对组合  使得每组的和相同 （数据一定满足条件） 输出n/2对组合的两个数的位置

题解：结构体排序 头尾配对输出各个的位置

//code  by drizzle
#include<bits/stdc++.h>
#include<iostream>
#include<cstring>
#include<cstdio>
#define ll __int64
#define PI acos(-1.0)
#define mod 1000000007
using namespace std;
int n;
struct node
{
    int x;
    int pos;
}N[105];
bool cmp(struct node aa,struct node bb)
{
    return aa.x<bb.x;
}
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        {
            scanf("%d",&N[i].x);
            N[i].pos=i;
        }
    sort(N+1,N+n+1,cmp);
    for(int i=1;i<=n/2;i++)
        printf("%d %d
",N[i].pos,N[n+1-i].pos);
    return 0;
}