l = list(map(int,input().split()))
c = 0
for i in l:
c+= l.count(i)
if c == 10 or c == 8:
print (2)
elif c==4:
print (0)
elif c== 16:
print(3)
else:
print(1)#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[4];
int i;
for(i=0;i<4;i++)
cin>>a[i];
int c=0;
sort(a,a+4);
for(i=0;i<3;i++)
{
if(a[i]==a[i+1])
c++;
}
cout<<c;
}1225C - p-binary | 1525D - Armchairs |
1257A - Two Rival Students | 1415A - Prison Break |
1271A - Suits | 259B - Little Elephant and Magic Square |
1389A - LCM Problem | 778A - String Game |
1382A - Common Subsequence | 1512D - Corrupted Array |
667B - Coat of Anticubism | 284B - Cows and Poker Game |
1666D - Deletive Editing | 1433D - Districts Connection |
2B - The least round way | 1324A - Yet Another Tetris Problem |
246B - Increase and Decrease | 22E - Scheme |
1566A - Median Maximization | 1278A - Shuffle Hashing |
1666F - Fancy Stack | 1354A - Alarm Clock |
1543B - Customising the Track | 1337A - Ichihime and Triangle |
1366A - Shovels and Swords | 919A - Supermarket |
630C - Lucky Numbers | 1208B - Uniqueness |
1384A - Common Prefixes | 371A - K-Periodic Array |