B. Little Robber Girl's Zoo（CF#359）

B. Little Robber Girl's Zoo

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Little Robber Girl likes to scare animals in her zoo for fun. She decided to arrange the animals in a row in the order of non-decreasing height. However, the animals were so scared that they couldn't stay in the right places.

The robber girl was angry at first, but then she decided to arrange the animals herself. She repeatedly names numbers l and r such thatr - l + 1 is even. After that animals that occupy positions between l and r inclusively are rearranged as follows: the animal at position lswaps places with the animal at position l + 1, the animal l + 2 swaps with the animal l + 3, ..., finally, the animal at position r - 1 swaps with the animal r.

Help the robber girl to arrange the animals in the order of non-decreasing height. You should name at most 20 000 segments, since otherwise the robber girl will become bored and will start scaring the animals again.

Input

The first line contains a single integer n (1 ≤ n ≤ 100) — number of animals in the robber girl's zoo.

The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 109), where ai is the height of the animal occupying the i-th place.

Output

Print the sequence of operations that will rearrange the animals by non-decreasing height.

The output should contain several lines, i-th of the lines should contain two space-separated integers li and ri (1 ≤ li < ri ≤ n) — descriptions of segments the robber girl should name. The segments should be described in the order the operations are performed.

The number of operations should not exceed 20 000.

If the animals are arranged correctly from the start, you are allowed to output nothing.

Examples

input

4
2 1 4 3

output

1 4

input

7
36 28 57 39 66 69 68

output

1 4
6 7

input

5
1 2 1 2 1

output

2 5
3 4
1 4
1 4

Note

Note that you don't have to minimize the number of operations. Any solution that performs at most 20 000 operations is allowed.

每次cf都是晚上打，晚上的状态确实不太好，昨天晚上的cf一道特别简单的题愣是没看出来是冒泡排序，还写了个三重循环以为不会超时，结果还是很正常的超时了。这道题给了一个限制最大不超过20000次处理，其实冒泡排序最大也就有10000次处理，根本不用考虑，直接把冒泡排序中交换的项都输出就可以了。

#include <iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
#define ll long long

using namespace std;

int main()
{
    int n,a[105];
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n-i;j++)
        {
            if(a[j]>a[j+1])
            {
                swap(a[j],a[j+1]);
                printf("%d %d\n",j,j+1);
            }
        }
    }
    return 0;
}