Problem: 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 that r - l + 1 is even. After that animals that occupy positions between l and r inclusively are rearranged as follows: the animal at position l swaps 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.

Solution (in JAVA):

Solution:
/**
 * nextInt() nextLong(); nextString() nextLine() nextCharacter()//reads non whitespace char nextDouble()
 * nextBigInteger()
 */
import java.io.IOException;
import java.io.InputStream;
import java.math.BigInteger;
import java.util.InputMismatchException;
public class B
{
	public static void main(String args[])
	{
		FastReader in = new FastReader(System.in);
		int n, i, swaps, temp;
		n = in.nextInt();

		int arr[] = new int[n];

		for (i = 0; i < n; i++)
			arr[i] = in.nextInt();

		while (true)
		{
			i = 0;
			swaps = 0;
			while (true)
			{
				while (i < n - 1 && arr[i] <= arr[i + 1])
					i++;
				if (i == n - 1)
					break;

				temp = arr[i];
				arr[i] = arr[i + 1];
				arr[i + 1] = temp;
				System.out.println((i + 1) + " " + (i + 2));
				swaps++;
				i++;
			}
			if (swaps == 0)
				return;
		}
	}
}

class FastReader
{
	private boolean finished = false;

	private InputStream stream;
	private byte[] buf = new byte[1024];
	private int curChar;
	private int numChars;
	private SpaceCharFilter filter;

	public FastReader(InputStream stream)
	{
		this.stream = stream;
	}

	public int read()
	{
		if (numChars == -1)
		{
			throw new InputMismatchException();
		}
		if (curChar >= numChars)
		{
			curChar = 0;
			try
			{
				numChars = stream.read(buf);
			}
			catch (IOException e)
			{
				throw new InputMismatchException();
			}
			if (numChars <= 0)
			{
				return -1;
			}
		}
		return buf[curChar++];
	}

	public int peek()
	{
		if (numChars == -1)
		{
			return -1;
		}
		if (curChar >= numChars)
		{
			curChar = 0;
			try
			{
				numChars = stream.read(buf);
			}
			catch (IOException e)
			{
				return -1;
			}
			if (numChars <= 0)
			{
				return -1;
			}
		}
		return buf[curChar];
	}

	public int nextInt()
	{
		int c = read();
		while (isSpaceChar(c))
			c = read();
		int sgn = 1;
		if (c == '-')
		{
			sgn = -1;
			c = read();
		}
		int res = 0;
		do
		{
			if (c == ',')
			{
				c = read();
			}
			if (c < '0' || c > '9')
			{
				throw new InputMismatchException();
			}
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	public long nextLong()
	{
		int c = read();
		while (isSpaceChar(c))
			c = read();
		int sgn = 1;
		if (c == '-')
		{
			sgn = -1;
			c = read();
		}
		long res = 0;
		do
		{
			if (c < '0' || c > '9')
			{
				throw new InputMismatchException();
			}
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	public String nextString()
	{
		int c = read();
		while (isSpaceChar(c))
			c = read();
		StringBuilder res = new StringBuilder();
		do
		{
			res.appendCodePoint(c);
			c = read();
		} while (!isSpaceChar(c));
		return res.toString();
	}

	public boolean isSpaceChar(int c)
	{
		if (filter != null)
		{
			return filter.isSpaceChar(c);
		}
		return isWhitespace(c);
	}

	public static boolean isWhitespace(int c)
	{
		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	}

	private String readLine0()
	{
		StringBuilder buf = new StringBuilder();
		int c = read();
		while (c != '\n' && c != -1)
		{
			if (c != '\r')
			{
				buf.appendCodePoint(c);
			}
			c = read();
		}
		return buf.toString();
	}

	public String nextLine()
	{
		String s = readLine0();
		while (s.trim().length() == 0)
			s = readLine0();
		return s;
	}

	public String nextLine(boolean ignoreEmptyLines)
	{
		if (ignoreEmptyLines)
		{
			return nextLine();
		}
		else
		{
			return readLine0();
		}
	}

	public BigInteger nextBigInteger()
	{
		try
		{
			return new BigInteger(nextString());
		}
		catch (NumberFormatException e)
		{
			throw new InputMismatchException();
		}
	}

	public char nextCharacter()
	{
		int c = read();
		while (isSpaceChar(c))
			c = read();
		return (char) c;
	}

	public double nextDouble()
	{
		int c = read();
		while (isSpaceChar(c))
			c = read();
		int sgn = 1;
		if (c == '-')
		{
			sgn = -1;
			c = read();
		}
		double res = 0;
		while (!isSpaceChar(c) && c != '.')
		{
			if (c == 'e' || c == 'E')
			{
				return res * Math.pow(10, nextInt());
			}
			if (c < '0' || c > '9')
			{
				throw new InputMismatchException();
			}
			res *= 10;
			res += c - '0';
			c = read();
		}
		if (c == '.')
		{
			c = read();
			double m = 1;
			while (!isSpaceChar(c))
			{
				if (c == 'e' || c == 'E')
				{
					return res * Math.pow(10, nextInt());
				}
				if (c < '0' || c > '9')
				{
					throw new InputMismatchException();
				}
				m /= 10;
				res += (c - '0') * m;
				c = read();
			}
		}
		return res * sgn;
	}

	public boolean isExhausted()
	{
		int value;
		while (isSpaceChar(value = peek()) && value != -1)
			read();
		return value == -1;
	}

	public String next()
	{
		return nextString();
	}

	public SpaceCharFilter getFilter()
	{
		return filter;
	}

	public void setFilter(SpaceCharFilter filter)
	{
		this.filter = filter;
	}

	public interface SpaceCharFilter
	{
		public boolean isSpaceChar(int ch);
	}
}

class Obj implements Comparable<Obj>
{
	char c;
	int size;

	public Obj(char c, int size)
	{
		this.c = c;
		this.size = size;
	}

	public int compareTo(Obj that)
	{
		if (this.size > that.size)
		{
			return -1;
		}
		else if (this.size < that.size)
		{
			return 1;
		}
		else
		{
			if (this.c < that.c)
			{
				return -1;
			}
			else if (this.c > that.c)
			{
				return 1;
			}
			else
			{
				return 0;
			}
		}
	}
}