Codeforces Round #364 (Div. 2)

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 a1, a2, ..., an (1 ≤ ai ≤ 100), where ai is equal to the number written on thei-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 ai are equal. Thus, any distribution is acceptable.

#include<stdio.h>
#include<algorithm>
using namespace std;
struct node{
int p,v;
}num[110];
bool cmp(node a,node b)
{
return a.v<b.v;
}
int main()
{
int n,a;
int l;
while(~scanf("%d",&n))
{
int l=0;
for(int i=1;i<=n;i++)
{
scanf("%d",&a);
num[i].p=i;
num[i].v=a;
}
sort(num+1,num+1+n,cmp);
for(int i=1;i<=n/2;i++)
printf("%d %d\n",num[i].p,num[n+1-i].p);
}
return 0;
}

B. Cells Not Under Attack

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Vasya has the square chessboard of size n × n and m rooks. Initially the chessboard is empty. Vasya will consequently put the rooks on the board one after another.

The cell of the field is under rook's attack, if there is at least one rook located in the same row or in the same column with this cell. If there is a rook located in the cell, this cell is also under attack.

You are given the positions of the board where Vasya will put rooks. For each rook you have to determine the number of cells which arenot under attack after Vasya puts it on the board.

Input

The first line of the input contains two integers n and m (1 ≤ n ≤ 100 000, 1 ≤ m ≤ min(100 000, n2)) — the size of the board and the number of rooks.

Each of the next m lines contains integers xi and yi (1 ≤ xi, yi ≤ n) — the number of the row and the number of the column where Vasya will put the i-th rook. Vasya puts rooks on the board in the order they appear in the input. It is guaranteed that any cell will contain no more than one rook.

Output

Print m integer, the i-th of them should be equal to the number of cells that are not under attack after first i rooks are put.

Examples

input

3 3
1 1
3 1
2 2

output

4 2 0 

input

5 2
1 5
5 1

output

16 9 

input

100000 1
300 400

output

9999800001 

车在的一行一列都要删去，剩下的格子一样可以形成一个矩形，当放车的（x,y）,如果x所在行,y所都未被放过，则x这一行和y这一列都要删去，如果x或y所在行列已被放过，则只有相应的列行删去，如果x，y所在行列都被访问过，则不删

#include<stdio.h>
#include<string.h>
int visit[100010];
int vis[100010];
int main()
{
__int64 p,q,m,n,x,y;
while(~scanf("%I64d%I64d",&n,&m))
{
memset(visit,0,sizeof(visit));
memset(vis,0,sizeof(vis));
p=q=n;
while(m--)
{
scanf("%I64d%I64d",&x,&y);
if(p==0||q==0)
printf("0\n");
else
{
if(vis[x]&&!visit[y])
{
q--;
visit[y]=1;
}
else if(!vis[x]&&visit[y])
{
p--;
vis[x]=1;
}
else if(!vis[x]&&!visit[y])
{
q--;
p--;
vis[x]=1;
visit[y]=1;
}
printf("%I64d\n",q*p);
  }
}
}
return 0;
}

They Are Everywhere

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Sergei B., the young coach of Pokemons, has found the big house which consists of n flats ordered in a row from left to right. It is possible to enter each flat from the street. It is possible to go out from each flat. Also, each flat is connected with the flat to the left and the flat to the right. Flat number 1 is only connected with the flat number 2 and the flat number n is only connected with the flat numbern - 1.

There is exactly one Pokemon of some type in each of these flats. Sergei B. asked residents of the house to let him enter their flats in order to catch Pokemons. After consulting the residents of the house decided to let Sergei B. enter one flat from the street, visit several flats and then go out from some flat. But they won't let him visit the same flat more than once.

Sergei B. was very pleased, and now he wants to visit as few flats as possible in order to collect Pokemons of all types that appear in this house. Your task is to help him and determine this minimum number of flats he has to visit.

Input

The first line contains the integer n (1 ≤ n ≤ 100 000) — the number of flats in the house.

The second line contains the row s with the length n, it consists of uppercase and lowercase letters of English alphabet, the i-th letter equals the type of Pokemon, which is in the flat number i.

Output

Print the minimum number of flats which Sergei B. should visit in order to catch Pokemons of all types which there are in the house.

Examples

input

3
AaA

output

2

input

7
bcAAcbc

output

3

input

6
aaBCCe

output

5

Note

In the first test Sergei B. can begin, for example, from the flat number 1 and end in the flat number 2.

In the second test Sergei B. can begin, for example, from the flat number 4 and end in the flat number 6.

In the third test Sergei B. must begin from the flat number 2 and end in the flat number 6.