Problem:
 Score : 100 points    Problem Statement AtCoDeer the deer recently bought three paint cans.
The color of the one he bought two days ago is a , the color of the one he bought yesterday is b , and the color of the one he bought today is c .
Here, the color of each paint can is represented by an integer between 1 and 100 , inclusive.  Since he is forgetful, he might have bought more than one paint can in the same color.
Count the number of different kinds of colors of these paint cans and tell him.      Constraints  1≦a,b,c≦100         Input The input is given from Standard Input in the following format:  a  b  c       Output Print the number of different kinds of colors of the paint cans.        Sample Input 1 3 1 4      Sample Output 1 3  Three different colors: 1 , 3 , and 4 .       Sample Input 2 3 3 33      Sample Output 2 2  Two different colors: 3 and 33 .

Solution (Python):
a =list(map(int, input().split()))
ans = 0
data = []
for i in a:
	if i not in data:
		data.append(i)
		ans+=1
print(ans)

Solution (Python):
print(len(set(input().split())))

Solution (Python):
s = set(input().split())
print(len(s))

Solution (Python):
a,b,c=map(int,input().split())
if a==b and a==c:
	print("1")
elif a==b and a!=c:
	print("2")
elif b==c and a!=c:
	print("2")
elif a==c and b!=c:
	print("2")
else:
	print("3")

Solution (Python):
col = list(map(int, input().split()))
print(len(set(col)))

Solution (Python):
import sys
input = sys.stdin.readline

a, b, c = map(int, input().split())
abc = [a, b, c]
abc = list(set(abc))
print(len(abc))

Solution (Python):
from collections import Counter
a = map(int, input().split())
a_cnt = Counter(a)
print(len(a_cnt))

Solution (Python):
paints = list(map(int, input().split()))
print(len(set(paints)))

Solution (Python):
a,b,c = map(int,input().split())

cnt = 0

if a != b:
    cnt = cnt + 1
if a != c: 
    cnt = cnt + 1
if b != c:
    cnt = cnt + 1

if cnt == 0:
    cnt = 1

print(cnt)

Solution (Python):
a = list(map(int,input().split()))
print(4-max(a.count(a[0]),a.count(a[1])))

Solution (Python):
a=map(int,input().split())
print(len(list(set(a))))

Solution (Python):
a = input().split()
print(len(set(a)))

Solution (Python):
N = list(map(int, input().split()))
ans = len(set(N))
print(ans)

Solution (Python):
a, b, c = map(int,input().split())
if a != b and b != c and c != a:
  print(3)
elif a == b and b == c:
  print(1)
else:
  print(2)

Solution (Python):
print(len(set(
  x for x in input().split()
             )))

Solution (Python):
a,b,c=list(map(int, input().split()))
X=[a,b,c]
ans=len(list(set(X)))
print(ans)

Solution (Python):
A, B, C = map(int, input().split())
if A == B == C:
  print(1)
elif A == B != C or A == C != B or B == C != A:
  print(2)
else:
  print(3)

Solution (Python):
l=set(input().split());print(len(l))

Solution (Python):
c=list(input().split())
print(len(list(set(c))))

Solution (Python):
a, b, c = map(int, input().split())
if a == b and b == c:
  print('1')
elif a == b or a == c or b == c:
  print('2')
else:
  print('3')

Solution (Python):
a = list(map(int, input().split()))

set_a = set(a)

print(len(set_a))

Solution (Python):
a, b, c = map(int, input().split())
print(len(set((a, b, c))))

Solution (Python):
a, b, c = map(int, raw_input().split())

cnt = 1

if a <> b:
    cnt += 1

if b <> c and a <> c:
    cnt += 1

print cnt

Solution (Python):
a = list(map(int, input().split()))

print(len(set(a)))

Solution (Python):
print(len(set(input().split())))

Solution (Python):
array = [int(i) for i in input().split()]

unique = set(array)

print(len(unique))

Solution (Python):
a= set(map(int, input().split()))
print(len(a))

Solution (Python):
a,b,c = map(int,input().split())

cnt = 0

if a == b:
    cnt += 1

if b == c:
    cnt += 1

if c == a:
    cnt += 1

if cnt == 0:
    print(3)
elif cnt == 1:
    print(2)
elif cnt == 3:
    print(1)

Solution (Python):
num = set(input().split())
print(len(num))

Solution (Python):
print(len(set(map(int, input().split()))))

Solution (Python):
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)

from math import factorial
import bisect
import math

def div(a, b):
    if a % b == 0:
        return a // b
    else:
        return (a // b) + 1

def main():
    num = list(map(int, input().split()))
    print(len(set(num)))




if __name__ == '__main__':
    main()

Solution (Python):

import sys
sys.setrecursionlimit(300000)


def solve(a: int, b: int, c: int):
    ret = len({a, b, c})
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    a = int(next(tokens))  
    b = int(next(tokens))  
    c = int(next(tokens))  
    solve(a, b, c)

if __name__ == '__main__':
    main()

Solution (Python):
a = list(map(int, input().split()))
b = {}
for i in range(len(a)):
    b[a[i]] = 1
print(len(b))

Solution (Python):
a,b,c = map(int,input().split())
if a == b and b == c:
    print('1')
elif a != b and  a != c and b != c:
    print('3')
else:
    print('2')

Solution (Python):
x=list(map(int,input().split()))

print(len(set(x)))

Solution (Python):
s = set(map(int,input().split()))
print(len(s))

Solution (Python):
s = set(input().split())
print(len(s))

Solution (Python):
x,y,z = map(int,input().split())
if x == y and y==z:
  print(1)
elif x == y or y == z or z ==x :
  print(2)
else:
  print(3)

Solution (Python):
print(len(set(input().split())))

Solution (Python):
col = set(map(int,input().split()))
print (len(col))

Solution (Python):
A = list(map(int, input().split()))
print(len(list(set(A))))

Solution (Python):
iro = list(map(int, input().split()))
shu = 1
iro.sort()
for i in range(1, len(iro)):
  if iro[i - 1] != iro[i]:
    shu += 1
print(shu)

Solution (Python):



a, b, c = map(int, input().split())


if a == b and b == c:
    ans = 1
elif a == b and b != c:
    ans = 2
elif a == c and b != c:
    ans = 2
elif b == c and c != a:
    ans = 2
else:
    ans = 3


print(ans)

Solution (Python):
a = set(list(map(int, input().split())))
print(len(a))

Solution (Python):
color = set(list(map(int, input().split())))
print(len(color))

Solution (Python):
print(len(set([int(x) for x in input().split()])))

Solution (Python):
a, b, c = map(int, input().split())
if a==b==c:
  print(1)
elif a==b or b==c or c==a :
  print(2)
else:
  print(3)

Solution (Python):
print(len(set(input().split())))

Solution (Python):
a = set(map(int,input().split()))
print(len(a))

Solution (Python):
a,b,c=map(int,input().split())
if a==b and b==c:
  print(1)
elif a==b or b==c or c==a:
  print(2)
else:
  print(3)

Solution (Python):
print(len(set(input().split(' '))))

Solution (Python):
a,b,c = map(int,input().split())
if a == b and b == c:
    print(1)
elif (a != b and b == c) or (a == b and b != c) or (a == c and c != b):
    print(2)
else:
    print(3)

Solution (Python):
a, b, c = input().split()
ans = {a, b, c}
print(len(ans))

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

l = LIST()
s = Counter(l)


print(len(s))

Solution (Python):
A, B, C = map(int, input().split())
lst = [A]
if B not in lst:
	lst.append(B)
if C not in lst:
	lst.append(C)
print(len(lst))

Solution (Python):

penki = input().split()

if penki[0] == penki[1] and penki[1] == penki[2]:
    print(1)

elif penki[0] == penki[1] and penki[1] != penki[2]:
    print(2)
    
elif penki[0] != penki[1] and penki[1] == penki[2]:
    print(2)

elif penki[0] != penki[1] and penki[0] == penki[2]:
    print(2)
    
else:
    print(3)

Solution (Python):
li = list(map(int, input().split()))
li = set(li)
print(len(li))

Solution (Python):
num = list(map(int,input().split()))
s_num = list(set(num)) 
print(len(s_num))

Solution (Python):
from collections import Counter
a = list(input().split())
print(len(Counter(a)))

Solution (Python):
num = list(map(int,input().split()))
a = set(num)
print(len(a))

Solution (Python):
z=list(map(int,input().split()))
a,b,c=z[0],z[1],z[2]
if a==b and a==c:
    print('1')
elif a!=b and a!=c and b!=c:
    print('3')
else:
    print('2')

Solution (Python):
a = {}
for i in list(map(int, input().split())):
    a[i] = 1
print(len(a))

Solution (Python):
a,b,c = map(int,input().split())
li = [a,b,c]
li = list(set(li))
print(len(li))

Solution (Python):

a = list(map(int,input().split()))

dic = {}

for i in a:

    dic[i] = 1

print(len(dic))

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


def A():
    a = LI()
    print(len(list(set(a))))
    return


def B():
    return


def C():
    return


def D():
    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return


if __name__ == '__main__':
    A()

Solution (Python):
print(len(set(map(int, input().split()))))

Solution (Python):
print(len(set(input().split())))

Solution (Python):
l=list(map(int, sorted(input().split())))
if l[0]==l[1]==l[2]:print(1)
elif l[0]!=l[1]!=l[2]!=l[0]:print(3)
else:print(2)

Solution (Python):
a = list(map(int, ("0 " + input()).split()))
b = 0
a.sort()
for i in range(1, 4):
    if a[i] != a[i-1]:
        b += 1
print(b)

Solution (Python):
print(len(set(input().split())))

Solution (Python):
print(len(set(input().split())))

Solution (Python):
print(len(set(input().split())))

Solution (Python):
a, b, c = map(int, input().split())

print(len(set([a, b, c])))

Solution (Python):
a = list(map(int, input().split()))
b = 1
a.sort()
for i in range(1, 3):
    if a[i] != a[i-1]:
        b += 1
print(b)

Solution (Python):



x = map(int,input().split())
print(len(list(set(x))))

Solution (Python):



tup = set(list(map(int, input().split())))
print(len(tup))

Solution (Python):
color = set(map(int,input().split()))
print(len(color))

Solution (Python):
print(len(set(input().split())))

Solution (Python):
colors = set(x for x in input().split())
print(len(colors))

Solution (Python):
print(len(list(set(input().split()))))

Solution (Python):
a, b, c = map(int, input().split())

if a==b and b==c:
    print(1)
elif a==b or b==c or c==a:
    print(2)
else:
    print(3)

Solution (Python):
a = set(map(int, input().split()))

print(len(a))

Solution (Python):

int_list = list(map(int, input().split()))
s = set(int_list)
print(len(s))

Solution (Python):
dict = {}
for s in input().split():
    if s not in dict:
        dict[s] = True

print(len(dict))

Solution (Python):
s = set(list(map(int,input().split())))
print(len(s))

Solution (Python):
def main():
    c = map(int,input().split(' '))
    ans = len(set(c))
    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):


def solve():
    a, b, c = list(map(int, input().split()))
    penki_set = set()
    penki_set.add(a)
    penki_set.add(b)
    penki_set.add(c)
    print(len(penki_set))

if __name__ == "__main__":
    solve()

Solution (Python):
a = list(map(int, input().split()))
print(len(set(a)))

Solution (Python):
nums = list(input().split())

print(len(set(nums)))

Solution (Python):
a,b,c = map(int,input().split())
s = list(set((a,b,c)))
print(len(s))

Solution (Python):
a = list(map(int,input().split(" ")))
print(len(list(set(a))))

Solution (Python):
a = set(map(int,input().split()))
print(len(a))

Solution (Python):
a=set(map(int,input().split()))
print(len(a))

Solution (Python):
color = list(map(int, input().split()))
l = []
for c in color:
    if l.count(c) == 0:
        l.append(c)
print(len(l))

Solution (Python):
color = {int(i) for i in input().split()}
print(len(color))

Solution (Python):
a, b, c = map(int, input().split())

if a == b == c:
    print(1)
elif a == b or b == c or a == c:
    print(2)
else:
    print(3)

Solution (Python):
a,b,c=map(int,input().split())
if a != b and b != c and c != a:
	print(3)
elif a == b == c:
	print(1)
else:
	print(2)

Solution (Python):
a,b,c=input().split()
if a!=b and b!=c and c!=a:
	print(3)
elif a!=b or b!=c or c!=a:
	print(2)
else:
	print(1)

Solution (Python):
a, b, c = map(int, input().split())

if a == b and b == c:
  print(1)
elif a==b or b==c or c==a:
  print(2)
else:
  print(3)

Solution (Python):
a, b, c = list(map(int, input().split()))
l = [a != b, b != c, c != a].count(True)
if l == 0:
	print(1)
else:
	print(l)

Solution (Python):
a = list(map(int, input().split()))
a = list(set(a))
print(len(a))

Solution (Python):
print(len(set(input().split())))

Solution (Python):
a,b,c = map(int,input().split())

if a == b and b == c:
	ans = 1
elif a != b and b != c and c != a:
	ans = 3
else :
	ans = 2 

print(ans)

Solution (Python):
abc = {int(x):1 for x in input().split()}
print(len(abc))

Solution (Python):
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

a, b, c = nl()
seen = set()
seen.add(a)
seen.add(b)
seen.add(c)
print(len(seen))

Solution (Python):
A = list(map(int, input().split()))

print(len(set(A)))

Solution (Python):
p=input().rstrip().split(' ')
print(len(list(set(p))))

Solution (Python):
lst = input().split()
print(len(set(lst)))

Solution (Python):
a = set(input().split())
print(len(a))

Solution (Python):
print(len(set(input().split())))

Solution (Python):
print(len(set(input().split())))

Solution (Python):
print(len(set(input().split())))

Solution (Python):


penki = input().split()
a = penki[0]
b = penki[1]
c = penki[2]
count = 1
if b != a:
    count +=1
if c != a and c != b:
    count +=1
print(count)

Solution (Python):
x = set(map(int, input().split()))

print(len(x))

Solution (Python):
t = set(map(int, input().split()))
print(len(t))

Solution (Python):
caralist = input().split()
print(len(set(caralist)))

Solution (Python):
print(len(set([x for x in input().split()])))

Solution (Python):
S = set(int(i) for i in input().split())
print(len(S))

Solution (Python):
ls = set(map(int, input().split()))
print(len(ls))

Solution (Python):
p = list(map(int, input().split()))
print(len(set(p)))

Solution (Python):

import copy
import random
import bisect 
import fractions 
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) 

a,b,c = map(int,input().split())
print(len(set([a,b,c])))

Solution (Python):
a = list(map(int,(input().split(' '))))



print(len(set(a)))

Solution (Python):
a, b, c = map(int, input().split())

if a == b == c:
  print(1)
elif a == b or b == c or c == a:
  print(2)
else:
  print(3)

Solution (Python):
a,b,c = map(int, input().split())

ans = 3

if a == b:
  if a == c:
    ans = 1
  else:
    ans = 2
elif a == c:
  ans = 2
elif b == c:
  ans = 2

print(ans)

Solution (Python):
a,b,c = map(int,input().split())
if a==b==c:
  print(1)
elif a==b or a==c or b==c:
  print(2)
else:
  print(3)

Solution (Python):
def abc():
    p = set(input().rstrip().split())
    print(len(p))


abc()

Solution (Python):
a,b,c=input().split()
if a==b==c:print("1")
elif a==b or b==c or c==a:print("2")
else:print("3")

Solution (Python):
print(len(list(set(list(input().split())))))

Solution (Python):
a=set(map(int,input().split()))
print(len(a))

Solution (Python):
S = list(map(int,input().split()))
S.sort()

ans = 1


if S[0] != S[1]:
  ans += 1
  
if S[1] != S[2]:
  ans += 1

print(ans)

Solution (Python):
print(len(set(input().split())))

Solution (Python):
S = set(input().split())

print(len(S))

Solution (Python):
a,b,c = map(int,input().split())
print(len(set([a,b,c])))

Solution (Python):


a, b, c = sorted(map(int, input().split()))

if a!=b and b!=c:
    print(3)
elif a!=b or b!=c:
    print(2)
else:
    print(1)

Solution (Python):
s = list(map(int, input().split()))
s = list(set(s))
print(len(s))

Solution (Python):
l = len(set(map(int, input().split())))
print(l)

Solution (Python):
a, b, c = map(int, input().split())
ans = [a]
if b in ans:
  pass
else:
  ans.append(b)
  
if c in ans:
  pass
else:
  ans.append(c)
  
print(len(ans))

Solution (Python):
a, b, c = raw_input().split()
if a == b and a == c:
    print "1"
elif a == b and a != c:
    print "2"
elif a == c and a != b:
    print "2"
elif b == c and b != a:
    print "2"
elif c == b and c != a:
    print "2"
else:
    print "3"

Solution (Python):
a, b, c = map(int, input().split())
if a == b and b == c:
    print(1)
elif (a != b and b == c) or (a == b and b != c) or (a == c and a != b):
    print(2)
else:
    print(3)

Solution (Python):
if __name__ == '__main__':
    A = list(map(int, input().split(' ')))
    print(len(set(A)))

Solution (Python):
print(len(set(input().split())))

Solution (Python):
print(len(set([int(x) for x in input().split()])))

Solution (Python):
l=[int(i) for i in input().split()]
print(len(set(l)))

Solution (Python):
a=set(input().split())
print(len(a))

Solution (Python):
i = list(map(int, input().split()))
a = i[0]
b = i[1]
c = i[2]

Cans = 0

if a == b:
    Cans += 1
    if b != c:
        Cans += 1

if a != b:
    Cans += 2
    if a != c and b != c:
        Cans += 1

print(Cans)

Solution (Python):
a, b, c = [int(s) for s in input().split()]
cntA = 3
cntB = 3
if a == b:
    cntA -= 1
if a == c:
    cntA -= 1
if b == c:
    cntB -= 1

print(min(cntA, cntB))

Solution (Python):
a=input().split()
if a.count(a[0])>1:
    answer=4-a.count(a[0])
else:
    answer=4-a.count(a[1])
print(answer)

Solution (Python):
a,b,c=input().split()
if a==b and b==c:
    answer=1
elif a==b or a==c or b==c:
    answer=2
else:
    answer=3
print(answer)

Solution (Python):
color = list(map(int, input().split()))

print(len(set(color)))

Solution (Python):

a, b, c = map(int, input().split())
print(len(set([a, b, c])))

Solution (Python):
a=set(list(map(int,input().split())))
print(len(a))

Solution (Python):
c=list(input().split())
print(len(set(c)))

Solution (Python):
a,b,c = input().split(' ')
print(len(set((a,b,c))))

Solution (Python):
a,b,c=input().split()

print(len({a,b,c}))

Solution (Python):
a,b,c=map(int,input().split())
print(len({a,b,c}))

Solution (Python):
n = list(map(int, input().split()))
print(len(set(n)))

Solution (Python):



a, b, c = map(int, input().split())





x = set()
x.add(a)
x.add(b)
x.add(c)

print(len(x))

Solution (Python):
l = list(map(int,input().split()))
print(len(set(l)))

Solution (Python):
colors = set(input().split())
print(len(colors))

Solution (Python):
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    a = f()
    print(len(set(a)))

solve()

Solution (Python):
a,b,c = map(int,input().split())
if a == b and b == c and c == a:
    print(1)
elif a == b and b != c and c != a:
    print(2)
elif a != b and b == c and c != a:
    print(2)
elif a != b and b != c and c == a:
    print(2)
else:
    print(3)

Solution (Python):

import sys
input = sys.stdin.readline
def mi(): return map(int, input().split())


abc = set(mi())

print(len(abc))

Solution (Python):
a, b, c = map(int, input().split())
print(len(set([a, b, c])))

Solution (Python):
s = list(set(map(int,input().split())))
print(len(s))

Solution (Python):
a,b,c = map(int,input().split(' '))
print(len(set([a,b,c])))

Solution (Python):
a, b, c = map(int, input().split())
if a == b and b == c:
  print(1)
elif a == b or b == c or c == a:
  print(2)
else:
  print(3)

Solution (Python):
print(len(set(input().split())))

Solution (Python):
xs = list(map(int, input().split()))
print(len(set(xs)))

Solution (Python):
l = list(map(int, input().split()))
s = 3
for i in range(3):
    for j in range(i + 1, 3):
        if l[i] == l[j]:
            s = s - 1
if l[0] == l[1] and l[1] == l[2]:
    s = s + 1
print(s)

Solution (Python):
l=set(map(int,input().split()))
print(len(l))

Solution (Python):
a = list(map(int,input().split()))
A = set()
for i in a:
    A.add(i)
print(len(list(set(A))))

Solution (Python):
print(len(set(input().split(' '))))

Solution (Python):
print(len(set(input().split(' '))))

Solution (Python):
s = set(map(int, input().split()))
print(len(s))

Solution (Python):
a, b, c = map(int, input().split())

if a == b and a == c:
    print(1)
elif a == b or a == c or b == c:
    print(2)
else:
    print(3)

Solution (Python):
a,b,c=map(int, input().split())

if a==b==c:
  print(1)
elif a==b or b==c or a==c:
  print(2)
else:
  print(3)

Solution (Python):
A  = list(map(int, input().split()))
print(len(set(A)))

Solution (Python):
print(len(set(input().split())))

Solution (Python):
print(len(set(map(int, input().split()))))

Solution (Python):
import collections
l=list(map(int,input().split()))
print(len(collections.Counter(l)))

Solution (Python):
print(len(set(input().split())))

Solution (Python):
a, b, c = map(int, input().split())
if a == b and a == c:
    print(1)
elif a == b or a == c or b == c:
    print(2)
else:
    print(3)

Solution (Python):
import collections
l = list(map(int,input().split()))
c = collections.Counter(l)
print(len(c))

Solution (Python):
a=input().split()
b=set(a)
print(len(b))

Solution (Python):
a, b, c = input().split()
if a != b and b != c and a != c:
  print(3)
elif a == b and b == c and a == c:
  print(1)
else:
  print(2)

Solution (Python):
a, b, c = input().split()
if a == b == c:
  print(1)
elif a == b or a == c or b == c:
  print(2)
else:
  print(3)

Solution (Python):
print(len(set(input().split())))

Solution (Python):
print(len(set(map(int,input().split()))))

Solution (Python):
a,b,c = map(int, input().split())
t = set([a,b,c])
print(len(t))

Solution (Python):
print(len(list(set(map(int,input().split())))))

Solution (Python):
a, b, c = map(int, input().split())
 
if a == b == c:
	print(1)
elif a == b or a == c or b == c:
	print(2)
else:
	print(3)

Solution (Python):
n = set(map(int,input().split()))
print(len(n))

Solution (Python):
print(len(set(input().split())))

Solution (Python):
print(len(set(input().split())))

Solution (Python):
a, b, c = map(int, input().split())
d = 0
ans = 3
if a == b:
    d += 1

if a == c:
    d += 1

if b == c:
    d += 1
if d == 3:
    d = 2

print(ans - d)

Solution (Python):
x=list(map(int,input().split()))

answer=set(x)

print(len(answer))

Solution (Python):
x=list(map(int,input().split()))

count=0
n=len(x)


for i in range(n):
	for j in range(i+1,n):
		if x[i]!=x[j]:
			count+=1


if count==0:
	count+=1


print(count)

Solution (Python):
print(len(set([int(i) for i in input().split()])))

Solution (Python):

"""
A - AtCoDeerくんとペンキ / AtCoDeer and Paint Cans
https://abc046.contest.atcoder.jp/tasks/abc046_a

"""
import sys


def solve(colors):
    return len(set(colors))


def main(args):
    colors = input().split()
    ans = solve(colors)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Solution (Python):
a, b, c = map(int, input().split())

if a == b and a == c:
	print(1)
elif a == b or a == c or b == c:
	print(2)
else:
	print(3)

Solution (Python):



list_num = [int(num) for num in input().split()]


print(len(list(set(list_num))))

Solution (Python):
a,b,c=map(int, input().split())
print(max((a!=b)+(b!=c)+(c!=a),1))

Solution (Python):
L = [int(i) for i in input().split()]
print(len(set(L)))

Solution (Python):
print(len(set([int(n) for n in input().split()])))

Solution (Python):
S = input().split()
print(len(set(S)))

Solution (Python):
a,b,c=map(int, input().split())
d={}
d[a]=1
d[b]=1
d[c]=1
print(len(d))

Solution (Python):
a,b,c=map(int, input().split())
if a==b and a==c:
    print(1)
elif a!=b and b!=c and c!=a:
    print(3)
else:
    print(2)

Solution (Python):
a,b,c=map(int, input().split())
if a==b and a==c:
    print(1)
elif a!=b and b!=c and c!=a:
    print(3)
else:
    print(2)

Solution (Python):
x = sorted(map(int,input().split(" ")))
if x[0] == x[2]:
  print(1)
elif x[0] == x[1] or x[1] == x[2]:
  print(2)
else:
  print(3)

Solution (Python):
a,b,c = map(int,input().split())
if a==b and b==c:
  print(1)
elif a==b or b==c or a==c:
  print(2)
else:
  print(3)

Solution (Python):
a =[int(i) for i in input().split()]
a = set(a)
print(len(a))

Solution (Python):
a = set(input().split())
print(len(a))

Solution (Python):
print(len(set(input().split())))

Solution (Python):
x = set(map(int, input().split()))
print(len(x))

Solution (Python):
print(len(set(input().split())))

Solution (Python):
x = list(map(int,input().split()))
print(len(set(x)))

Solution (Python):
a,b,c = map(int,input().split())

if a == b and b == c:
    print(1)
elif a == b or b == c or c == a:
    print(2)
else:
    print(3)

Solution (Python):
a =  list(map(int, input().split()))
print(len(set(a)))

Solution (Python):
a, b, c = map(int, input().split())

if a == b and a == c:
    print(1)
elif a == b or b == c or a == c:
    print(2)
else:
    print(3)

Solution (Python):
print(len(set(list(map(int, input().split())))))

Solution (Python):
a,b,c = map(int,input().split())

l=[a,b,c]

print(len(set(l)))

Solution (Python):
a = list(map(int,input().split()))
b=set(a)
print(len(b))

Solution (Python):
arr = set(list(map(int, input().split())))
print(len(arr))

Solution (Python):
a, b, c = map(int, input().split())
if a == b and b == c:
    print(1)
elif a == b and b != c or b == c and a != b or a==c and a!=b:
    print(2)
else:
    print(3)

Solution (Python):
print(len(set(list(map(int,input().split())))))

Solution (Python):
a, b, c = map(int, input().split())

st = { a, b, c }
print(len(st))

Solution (Python):
a, b, c = map(int, input().split())
print(len(set([a, b, c])))

Solution (Python):
a, b, c = map(int, input().split())
if a == b == c:
    print(1)
elif a == b or b == c or c == a:
    print(2)
else:
    print(3)

Solution (Python):
l = list(input().split())
print(len(set(l)))

Solution (Python):
print(len(set(input().split())))

Solution (Python):
a = list(map(int, input().split()))
a = list(set(a))
print(len(a))

Solution (Python):
def main():
	a, b, c = map(int, input().split())
	ans = set([a, b, c])
	print(len(ans))


if __name__ == '__main__':
	main()

Solution (Python):
penki = input().rstrip().split(' ')
penki.sort(key=int,reverse=False)

K = 0

for i in range(3):
    temp = penki[i]
    if i == 0:
        K += 1
    elif i > 0 and penki[i-1] == temp:
        pass
    else:
        K += 1

print(K)

Solution (Python):
a=input().split()
print(len(set(a)))

Solution (Python):
a = list(map(int,input().split()))
a.sort()
if a[0] != a[1] and a[1] != a[2]:
  print(3)
elif a[0] == a[1] and a[1] == a[2]:
  print(1)
else:
  print(2)

Solution (Python):
a, b, c = map(int, input().split())

if a == b == c:
    print(1)
elif a == b or a == c or b == c:
    print(2)
else:
    print(3)

Solution (Python):
print(len(set(map(int,input().split()))))

Solution (Python):
def main():
    list = [int(x) for x in input().split()]
    list = set(list)

    print(len(list))

if __name__ == "__main__":
    main()

Solution (Python):
import collections
L = [int(i) for i in input().split()]

c = collections.Counter(L)
print(len(c))

Solution (Python):
a, b, c = map(int, input().split())
num = [0]*101
num[a] += 1
num[b] += 1
num[c] += 1

ans = 0
for i in num:
    if i > 0:
        ans += 1
    
print(ans)

Solution (Python):
print(len(set(input().split())))

Solution (Python):
def read_input():
    a, b, c = map(int, input().split())
    return a, b, c


def submit():
    a, b, c = read_input()

    d = {}
    d[a] = 1
    d[b] = 1
    d[c] = 1

    print(len(d))

if __name__ == '__main__':
    submit()

Solution (Python):
abc = set(input().split())
print(len(abc))

Solution (Python):
A = list(map(int, input().split()))
print(len(list(set(A))))

Solution (Python):


def solve(a, b, c):
    A = []
    A.append(a)
    A.append(b)
    A.append(c)
    print(len(set(A)))
                
if __name__ == '__main__':
    a, b, c = map(int, input().split())

    solve(a, b, c)

Solution (Python):
from collections import Counter
a = list(map(int,input().split()))
c = Counter(a)
print(len(c))

Solution (Python):
print(len(set(map(int,input().split()))))

Solution (Python):
a = list(map(int, input().split()))
print(len(set(a)))

Solution (Python):
print(len(set(input().split())))

Solution (Python):
a=list(map(int, input().split()))
b=3
if a[0]==a[1]:
  b-=1
if a[1]==a[2]:
  b-=1
if a[0]==a[2]:
  b-=1
if b==0:
  b+=1
print(b)

Solution (Python):


s = set(map(int, input().split()))

print(len(s))

Solution (Python):


n = set(map(int, input().split()))

print(len(n))

Solution (Python):
a,b,c=(int(x) for x in input().split())

if a!=b and b!=c and c!=a:
    print('3')
elif a!=b or b!=c or c!=a:
    print('2')
else:
    print('1')

Solution (Python):
print(len(set(input().split())))

Solution (Python):
print(len(set(map(int,input().split()))))

Solution (Python):
print(len(set([int(i) for i in input().split()])))

Solution (Python):


a, b, c = map(int, input().split())
color = [a, b, c]
color_unique = set(color)
print(len(color_unique))

Solution (Python):
a, b, c = map(int,input().split())
if a == b == c:
    print(1)
elif a == b or b == c or a == c:
    print(2)
else:
    print(3)

Solution (Python):
import sys

def main():
    input = sys.stdin.readline
    A = list(map(int, input().split()))

    return len(set(A))


if __name__ == '__main__':
    print(main())

Solution (Python):

print(len(set(list(map(int, input().rstrip().split())))))

Solution (Python):
a = list(map(int,input().split()))
a = set(a)
print(len(a))

Solution (Python):
a,b,c=map(int, input().split())

if a==b==c:
    print('1')
elif a==b or b==c or c==a:
    print('2')
else:
    print('3')

Solution (Python):
a=list(map(int,input().split()))
a.sort()
print(1 if a[0]==a[2] else 2 if a[0]==a[1] or a[1]==a[2] else 3)

Solution (Python):
li = list(map(int,input().split()))
cnt = 3
if li[0] == li[1]:
	cnt -= 1
if li[0] == li[2]:
	cnt -= 1
if li[1] == li[2]:
	cnt -= 1
if li[0] == li[1] and li[1] == li[2]:
	cnt = 1
print(cnt)

Solution (Python):
s = list(map(int, input().split()))

if(s[0] == s[1] and s[1] == s[2]):
    print(1)
elif(s[0] == s[1] or s[1] == s[2] or s[0] == s[2]):
    print(2)
else:
    print(3)

Solution (Python):
a,b,c = list(map(int, input().split()))
print(len(set({a,b,c})))

Solution (Python):
a = list(map(int,input().split()))
print(len(set(a)))

Solution (Python):
a,b,c = map(int,input().split())
if a == b == c:
    print(1)
elif a == b or b == c or a == c:
    print(2)
else:
    print(3)

Solution (Python):
a,b,c = map(int,input().split())
if a==b==c:
    print(1)
elif a!=b and a!=c and b!=c:
    print(3)
else:
    print(2)