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,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=map(int,input().split())
print("1" if (a==b==c) else "2" if (a==b!=c or a==c!=b or c==b!=a) else "3" )

Solution (Python):
a={int(i) for i in map(int, input().split())}

print(len(a))

Solution (Python):

import sys
input = sys.stdin.readline


A,B,C = map(int,input().split())

print(len({A,B,C}))

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

Solution (Python):
def examA():
    abc = LI()
    abc = set(abc)
    print(len(abc))


import sys
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

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

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

l = [0] * 3

l[0] = a
l[1] = b
l[2] = c

k = [0] * 3

k[0] = l.count(a)
k[1] = l.count(b)
k[2] = l.count(c)

t = max(k)

if t == 1:
	t = 3
elif t ==3:
	t = 1
else:
	pass


print(t)

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 and c == a:
  print(1)
else:
  print(2)

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

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

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

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

Solution (Python):
A,B,C = map(int,input().split())
K = 1
if A != B:
    K = K + 1
else:
    pass
if A != C:
    if B != C:
        K = K + 1
    else:
        pass
else:
    pass
print(int(K))

Solution (Python):


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

print(len(b))

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

Solution (Python):
def solve():
    lis = list(map(int, input().split()))

    

    def unique_list(seq):
        _set = set()
        set_add = _set.add
        return [x for x in seq if x not in _set and not set_add(x)]

    return len(unique_list(lis))


if __name__ == '__main__':
    res = solve()
    print(res)

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

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

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

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

Solution (Python):
li = list(map(int, input().split()))
ans = 0
li.sort()
for i in range(len(li)):
  if i >= 1:
    if li[i-1] != li[i]:
      ans += 1
  else:
    ans += 1
print(ans)

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

Solution (Python):


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

print(len(set(abc)))

Solution (Python):

paints = [int(s) for s in input().split()]
print(len(set(paints)))

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

Solution (Python):

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

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

print(len(s))

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(list(set(input().split()))))

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

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

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

if a == b == 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==c:
    print(1)
elif a==b!=c or a==c!=b or b==c!=a:
    print(2)
else:
    print(3)

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

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

Solution (Python):
colors = [color for color in input().split()]
colors.sort()

first = colors[0]

current = first
count = 1
for i in range(1, 3):
    if colors[i] != current:
        count += 1
        current = colors[i]

print(count)

Solution (Python):
colors = [color for color in input().split()]

print(len(set(colors)))

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

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

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

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

print(len(set(abc)))

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

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

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):
print(len(set(input().split())))

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

Solution (Python):
l = input().split()
color = set(l)
print(len(l) if len(color) == len(l) else len(color))

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

Solution (Python):
i_list = input().split()
uni_list = set(i_list)

print(str(len(uni_list)))

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
c = list(map(int,input().split()))
print(len(set(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 a == c):
    print(2)

else:
    print(3)

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

print(len(s))

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

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

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

total=set(c)
print(len(total))

Solution (Python):
if __name__ == "__main__":
    colors = set(input().split())
    print(len(colors))

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

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

Solution (Python):
penki = [int(_) for _ in input().split()]
p = set(penki)
print(len(p))

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

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

Solution (Python):


l = list(input().split())

print(len(set(l)))

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

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

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

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

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

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

Solution (Python):
a=input()
A=a.split()
ans=3
if A[0]==A[1] or A[1]==A[2] or A[0]==A[2]:
  ans-=1
if A[0]==A[1]==A[2]:
  ans-=1
print(ans)

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

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

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

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

print(len(set(abc)))

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

print(len(set(S)))

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

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

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

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

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

Solution (Python):
from collections import defaultdict
count=defaultdict(lambda: 0)
a,b,c=list(map(int,input().split(" ")))
count[a]+=1
count[b]+=1
count[c]+=1
print(len(count.keys()))

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

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

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

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

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

print(len(set(color)))

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

Solution (Python):
def slove():
    import sys
    import collections
    input = sys.stdin.readline
    abc = list(map(int, input().rstrip('\n').split()))
    abc = collections.Counter(abc).most_common()
    print(len(abc))


if __name__ == '__main__':
    slove()

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

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

Solution (Python):
a,b,c=[int(i) for i in 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())
if a == b == c:
    print(1)
elif a == b or b == c or c == a:
    print(2)
else:
    print(3)

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    print(len(set(input().split())))


if __name__ == "__main__":
    main()

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

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

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

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

ans = 1


if b != a:
    ans += 1
else:
    pass

if c != a and c != b:
    ans += 1
else:
    pass
    
print(ans)

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

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

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())

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

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

Solution (Python):

paints = input().split()
set_paints = set(paints)
print(len(set_paints))

Solution (Python):
a,b,c=map(int,input().split())
ans=1
if a==b==c:
  a=1
else:
  if a!=b:
    ans+=1
  if b!=c:
    ans+=1
  if a==c:
    ans-=1
print(ans)

Solution (Python):

N = input().split()
print(len(set(N)))

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

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

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

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

Solution (Python):
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')


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

print(len(set(a)))

Solution (Python):


from collections import Counter

a, b, c = map(int, input().split())
c = Counter((a, b, c))
ans = len(c)
print(ans)

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())
print(len(set([a,b,c])))

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
def do():
    a=LIST()
    s=set(a)
    print(len(s))
if __name__ == '__main__':
    do()

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

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

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

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

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

Solution (Python):
input_ = input().split()

type = len(set(input_))

print(type)

Solution (Python):
a,b,c = map(int,input().split())
count = 3
if a == b:
    count -= 1
if b == c:
    count -= 1
if c == a:
    count -= 1
if count == 0:
    count = 1
print(count)

Solution (Python):
def main():
  colors = [int(x) for x in raw_input().split()]
  print(len(set(colors)))

main()

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

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

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

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

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

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


if __name__ == "__main__":
    resolve()

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

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

Solution (Python):
from collections import Counter

ABC = list(input().split())
print(len(Counter(ABC)))

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

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

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

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

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

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 a != c) or (b == c and a != b) or (a == c and a != b):
  print(2)
else:
  print(3)

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

Solution (Python):
a,b,c = map(int,input().split())
ans = 1
if a != b :
    ans+=1
if a != c and b != c:
    ans+=1

print(ans)

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

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

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


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):

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

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

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

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

if a == b and b == c:
    print(1)

elif a != b and b == c:
    print(2)

elif a == b and b != c:
    print(2)

elif 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())

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

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

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

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

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

if abc[0]==abc[1]==abc[2]:
    print("1")
elif abc[0]==abc[1] or abc[1]==abc[2] or abc[2]==abc[0]:
    print("2")
else:
    print("3")

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

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

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

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

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

checklist = []
for i in list:
    if i not in checklist:
        checklist.append(i)
print(len(checklist))

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

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

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

c = set(s)
print(len(c))

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

Solution (Python):
import collections

pen = list(map(str,input().split()))

print(len(collections.Counter(pen)))

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
a = [int(_) for _ in input().split()]
if all(1 <= i <= 100 for i in a):
    a.sort();print(1 if a[0] == a[1] == a[2] else 2 if a[0] == a[1] or a[1] == a[2] else 3)
else:
    print('hoge!')

Solution (Python):
N = input().split()
colors = []
for i in range(len(N)):
    if N[i] not in colors:
        colors.append(N[i])
print(len(colors))

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

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

num_list = [0 for i in range(101)]
num_list[a] = num_list[b] = num_list[c] = 1
print(sum(num_list))

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

Solution (Python):
import sys
from collections import Counter

stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

mod = 10 ** 9 + 7

li = na()
c = Counter(li)
print(len(c.keys()))

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

A.sort()

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

Solution (Python):
def main():
    a, b, c = list(map(int, input().split()))
    if a == b:
        if a == c:
            print(1)
        else:
            print(2)
    elif a == c:
        print(2)
    elif b == c:
        print(2)
    else:
        print(3)
    
    pass
if __name__ == '__main__':
    main()

Solution (Python):


A = list(map(str, input().split()))
count = 0
for i in range(len(A)-1):
    if A[i] != A[i+1]:
        count += 1
    else:
        pass
if A[0] != A[2]:
    count += 1
else:
    pass
if A[0] == A[1] ==A[2]:
    count = 1

print(count)

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

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

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

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

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

Solution (Python):
A,B,C = map(int,input().split())
ans =1
if A != B:
  ans += 1
if A != C and B != C:
  ans += 1
print(ans)

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

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

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

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

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

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

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

print(len(set(ans)))

Solution (Python):
def main():

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

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

Solution (Python):
import argparse
from sys import stdin

"""
parser = argparse.ArgumentParser()

parser = argparse.ArgumentParser(
            prog='a', 
            usage='Count paint number', 
            description='Description', 
            epilog='end', 
            add_help=True, 
            )
 

parser.add_argument('infile', help='inputfile',
                    type=argparse.FileType('r'))
 

args = parser.parse_args()
 
message = args.infile.read()
args.infile.close();

parser.add_argument('arg1', help='input flie name')

a = message[0]
b = message[1]
c = message[2]
"""

a, b, c = [int(x) for x in stdin.readline().rstrip().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 or b==c or c==a:
  if a==b==c:
    out = 1
  else:
    out = 2
else:
  out = 3
print(out)

Solution (Python):
import collections
P = input().split()
p = collections.Counter(P)
print(len(p))

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

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

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

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

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

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

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

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

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

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):
p = set(map(int, input().split()))

print(len(p))

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

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

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

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

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

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

if a == b == c:
    print(1)

elif (a==b and b!=c) or (b==c and a!=b) or (a==c and b!=a):
    print(2)

else:
    print(3)

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

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

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

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

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

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

Solution (Python):
import collections

li = list(map(int, input().split()))
c = collections.Counter(li)

print(len(c.keys()))

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

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

Solution (Python):
a=list(map(int,input().split()))
b=[]
for x in range(len(a)):
  if a[x] not in b:
    b.append(a[x])
print(len(b))

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(map(int,input().split()))))

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

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):
line = input().split()
count = 0
if line.count(line[0])==3:
    print(1)
elif line.count(line[1])==2 or line.count(line[0])==2:
    print(2)
else:
    print(3)

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

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

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

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

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

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

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

Solution (Python):
a,b,c = 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):
L = list(map(int, input().split()))
print(len(set(L)))

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

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

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

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

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


if __name__ == "__main__":
    test()

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

Solution (Python):
import collections

a = input()
c = collections.Counter(a.split())

print(len(c))

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

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(list(map(int,input().split())))))

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

A = set(A)

print(len(A))

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

print(len(set(arr)))

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

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

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

Solution (Python):
cs = list(map(int, input().split()))
count = 0
arr = []
for i in range(len(cs)):
    if cs[i] not in arr:
        count += 1
    arr.append(cs[i])

print(count)

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

Solution (Python):

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

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

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

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

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

Solution (Python):
s = input().split()
count = 0
flag = False
for i in range(len(s)):
    for j in range(i+1,len(s)):
        if s[i] == s[j]:
            count-=1
    count+=1
if count == 0:
    count = 1
print(count)

Solution (Python):
import sys
import bisect
input = sys.stdin.readline
 
def main():
    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)
    
main()

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

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

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

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


else:
    print(3)

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

Solution (Python):
import collections
print(len(collections.Counter(input().split())))

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

print(len(a))

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

print(len(set(a)))

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

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

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

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

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

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

Solution (Python):

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

Solution (Python):

a,b,c= [int(i) for i in 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(list(input().split()))))

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

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

Solution (Python):

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

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

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

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

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

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

Solution (Python):
num = list(input().split())
num = sorted(num)
count = 0
for i in range(2):
  if num[i] == num[i+1]:
    count += 1
print(3 - count)

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

Solution (Python):
ptn = {}
numstr = input()
for n in numstr.split():
    ptn[n] = 1

print(len(ptn))

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

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

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