CodeForces 651A 651B

651A:Joysticks

Friends are going to play console. They have two joysticks and only one charger for them. Initially first joystick is charged at a1 percent and second one is charged at a2 percent. You can connect charger to a joystick only at the beginning of each minute. In one minute joystick either discharges by 2 percent (if not connected to a charger) or charges by 1 percent (if connected to a charger).

Game continues while both joysticks have a positive charge. Hence, if at the beginning of minute some joystick is charged by 1 percent, it has to be connected to a charger, otherwise the game stops. If some joystick completely discharges (its charge turns to 0), the game also stops.

Determine the maximum number of minutes that game can last. It is prohibited to pause the game, i. e. at each moment both joysticks should be enabled. It is allowed for joystick to be charged by more than 100 percent.

Input

The first line of the input contains two positive integers a1 and a2 (1 ≤ a1, a2 ≤ 100), the initial charge level of first and second joystick respectively.

Output

Output the only integer, the maximum number of minutes that the game can last. Game continues until some joystick is discharged.

Examples

Input

3 5

Output

6

Input

4 4

Output

5

Note

In the first sample game lasts for 6 minute by using the following algorithm:

• at the beginning of the first minute connect first joystick to the charger, by the end of this minute first joystick is at 4%, second is at 3%;
• continue the game without changing charger, by the end of the second minute the first joystick is at 5%, second is at 1%;
• at the beginning of the third minute connect second joystick to the charger, after this minute the first joystick is at 3%, the second one is at 2%;
• continue the game without changing charger, by the end of the fourth minute first joystick is at 1%, second one is at 3%;
• at the beginning of the fifth minute connect first joystick to the charger, after this minute the first joystick is at 2%, the second one is at 1%;
• at the beginning of the sixth minute connect second joystick to the charger, after this minute the first joystick is at 0%, the second one is at 2%.

After that the first joystick is completely discharged and the game is stopped.

 充电游戏，直接实验步骤就行

#include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	int a,b,count=0;
	scanf("%d%d",&a,&b);
	while(a>0&&b>0)
	{
	if(a==1&&b==1)  break;
	if(a<b)
	{
		b-=2;a+=1;count++;
	}
	else
	{
		a-=2;b+=1;count++;
	}
    }
    printf("%d\n",count);
	return 0;
}

 当a，b中一个为0，一个为3结束，特别注意a，b都为1时，不成立，结束！！！记得列举特殊情况

651B：Beautiful Paintings

There are n pictures delivered for the new exhibition. The i-th painting has beauty ai. We know that a visitor becomes happy every time he passes from a painting to a more beautiful one.

We are allowed to arranged pictures in any order. What is the maximum possible number of times the visitor may become happy while passing all pictures from first to last? In other words, we are allowed to rearrange elements of a in any order. What is the maximum possible number of indices i (1 ≤ i ≤ n - 1), such that ai + 1 > ai.

Input

The first line of the input contains integer n (1 ≤ n ≤ 1000) — the number of painting.

The second line contains the sequence a1, a2, ..., an (1 ≤ ai ≤ 1000), where ai means the beauty of the i-th painting.

Output

Print one integer — the maximum possible number of neighbouring pairs, such that ai + 1 > ai, after the optimal rearrangement.

Examples

Input

5
20 30 10 50 40

Output

4

Input

4
200 100 100 200

Output

2

Note

In the first sample, the optimal order is: 10, 20, 30, 40, 50.

In the second sample, the optimal order is: 100, 200, 100, 200.

 排列，不出现相同大小的。化为矩阵，相同数字为一列，每行按从小到大排。

出现新奇感的是  总个数 -1 --矩阵行数（出现次数最多的数的次数）

#include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    int n,i,a[1005],t=0,max=0,flag=0;
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
    	scanf("%d",&a[i]);
	}
	sort(a,a+n);
	flag=a[0];
	for(i=1;i<n;i++)
	{
	    if(a[i]==a[i-1]) {
		         t++;
				 }
	    if(max<t){
				max=t;
			}
		if(a[i]!=flag)
		{
			flag=a[i];
			t=0;
		}	
	}
	printf("%d\n",n-max-1);
	return 0;
}

附leaderboard首代码，数字作地址，数组值为该数字出现次数。