小水

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=43311#problem/A

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

#include <stdio.h>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
    int a[5];
    while(~scanf("%d%d%d%d",&a[0],&a[1],&a[2],&a[3]))
    {
        int k=0;
        sort(a,a+4);
        for(int i=1;i<4;i++)
           if(a[i]==a[i-1])
               k++;
        printf("%d\n",k);
    }
    return 0;
}