Is your horseshoe on the other hoof?

Is your horseshoe on the other hoof?

Crawling in process... Crawling failed Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Description

Valera the Horse is going to the party with friends. He has been following the fashion trends for a while, and he knows that it is very popular to wear all horseshoes of different color. Valera has got four horseshoes left from the last year, but maybe some of them have the same color. In this case he needs to go to the store and buy some few more horseshoes, not to lose face in front of his stylish comrades.

Fortunately, the store sells horseshoes of all colors under the sun and Valera has enough money to buy any four of them. However, in order to save the money, he would like to spend as little money as possible, so you need to help Valera and determine what is the minimum number of horseshoes he needs to buy to wear four horseshoes of different colors to a party.

Input

The first line contains four space-separated integers s₁, s₂, s₃, s₄ (1 ≤ s₁, s₂, s₃, s₄ ≤ 10⁹) — the colors of horseshoes Valera has.

Consider all possible colors indexed with integers.

Output

Print a single integer — the minimum number of horseshoes Valera needs to buy.

Sample Input

Input

1 7 3 3

Output

1

Input

7 7 7 7

Output

3

Sample Output

1024
1024
0
792

Note

In the second sample, if Alice doesn't pick any mushrooms from the 5-th mountain. She can give (512+512+0)=1024 grams of mushrooms to Sunny, Lunar and Star. Marisa won't steal any mushrooms from her as she has exactly 1 kilograms of mushrooms in total.

In the third sample, there are no three bags whose total weight is of integral kilograms. So Alice must leave all the five bags and enter the forest with no mushrooms.

In the last sample:

• Giving Sunny, Lunar and Star: (208+308+508)=1024
• Stolen by Marisa: ((708+1108)-1024)=792

Hint

题意：给出四个数、输出重复数的个数

#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
    int num[4];
    while(scanf("%d",&num[0])!=EOF)
    {
        int i,res=0;
        for(i=1;i<4;i++)
         scanf("%d",&num[i]);
        sort(num,num+4);
        for(i=0;i<3;i++)
         if(num[i]==num[i+1])
          res++;
        printf("%d\n",res);
    }
    return 0;
}