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

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

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

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

Solution (Python):

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

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

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

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

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

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

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

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

Solution (Python):
a,b,c=list(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):
inputList = list(map(int,input().split(" ")))
temp = []

for i in range(3):
    if inputList[i] not in temp:
        temp.append(inputList[i])

print(len(temp))

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

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


def main():
    a = input().split()
    s = set(a)
    return len(s)


print(main())

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

Solution (Python):
a,b,c = [int(x) for x in raw_input().split(" ")]

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

elif a == b or b == c or c == a:
	print 2

else:
	print 3

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

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


if __name__ == '__main__':
    main()

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

Solution (Python):
import sys

abc = sys.stdin.readline().split()
abc_arr = []
for x in abc:
    if x not in abc_arr:
        abc_arr.append(x)
print len(abc_arr)

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

Solution (Python):

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

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


if __name__ == '__main__':
    main()

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

Solution (Python):
print(len(set(map(int,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):




l = list(map(int, input().split()))
l.sort()
a = l[0]
b = l[1]
c = l[2]

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

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

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

print(ans)

Solution (Python):
M = map(int, raw_input().split())

print len(set(M))

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

Solution (Python):



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

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

col_kind=[]

for i in col:
    if i in col_kind:
        pass
    else:
        col_kind.append(i)

print len(col_kind)

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

Solution (Python):
inp = raw_input()
print len(set(inp.strip().split(' ')))

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

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

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

Solution (Python):
i = raw_input().split(' ')
if i[0] != i[1]:
  if i[1] != i[2]:
    re = 3 if i[2] != i[0] else 2
  else:
    re = 2
else:
  re = 2 if i[1] != i[2] else 1
      
print re

Solution (Python):
ho=input().split()
if(int(ho[0]) == int(ho[1]) == int(ho[2])):
    print(1)
elif (int(ho[0]) == int(ho[1]) or int(ho[1]) == int(ho[2]) or int(ho[2]) == int(ho[0])):
    print(2)
else:
    print(3)

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

Solution (Python):

def penki(a, b, c):
  if a==b and b==c:
    return 1
  elif a!=b and b!=c and c!=a:
    return 3
  else:
    return 2

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

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

Solution (Python):
a = map(int,raw_input().split(" "))
b = a[0]
c = a[1]
d = a[2]
cnt = 3
if b == c:
    cnt = cnt -1
if b == d:
    cnt = cnt -1
if c == d:
    cnt = cnt -1
if c == d and c == b and b == d:
    cnt = cnt + 1
print cnt

Solution (Python):
a,b,c = map(int,raw_input().split())
x = [False for i in range(101)]
x[a] = True
x[b] = True
x[c] = True
cnt = 0
for i in x:
    if i:
        cnt+=1
print cnt

Solution (Python):
list = str(input()).split()
if int(list[0]) == int(list[1]):
   if int(list[1]) == int(list[2]):
      print(1)
   else :
      print(2)
elif int(list[0]) == int(list[2]):
   print(2)
elif int(list[1]) == int(list[2]):
   print(2)
else:
   print(3)

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

Solution (Python):
def main():
	inpt = raw_input().split()
	cnt = 0
	for i in range(0, 3):
		if inpt[i] == inpt[(i+1)%3]:
			cnt += 1
	if cnt == 3:
		cnt -= 1
	print 3 - cnt
	
main()

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

Solution (Python):
item_list = [0]*101
cnt = 0
a = map(int, input().split())
for i in a:
    if not item_list[i]:
        item_list[i] = 1
        cnt += 1
print(cnt)

Solution (Python):
import sys

print len(set(sys.stdin.readline().split()))

Solution (Python):
try:
    color = map(int, raw_input().split(" "))
    count_col=list(set(color))
    print len(count_col)

except EOFError:
    pass

Solution (Python):

from collections import Counter

print(len(Counter([int(i) for i in input().split()])))

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

for i in a:
    d.add(i)

print(len(d))

Solution (Python):
a = [int(x) for x in raw_input().split()]
dic = {}
for x in a:
    dic[x] = 1

print len(dic)

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

Solution (Python):


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

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

Solution (Python):

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

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

Solution (Python):

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

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

Solution (Python):

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

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

Solution (Python):

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

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

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

Solution (Python):



set_of_cans = set(map(int, raw_input().split()))
print len(set_of_cans)

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

colour_list = [a, b, c]
bought = []
count = 0
for x in colour_list:
    if x not in bought:
        bought.append(x)
        count += 1

print count

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

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

Solution (Python):
line = input()
elems = line.split()
penkis = {int(e) for e in elems}
print(len(penkis))

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

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

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

Solution (Python):
penki = input().split(" ")
if penki[0] == penki[1]:
    if penki[1] == penki[2]:
        print("1")
    else:
        print("2")
elif penki[1] == penki[2]:
    print("2")
elif penki[0] == penki[2]:
    print("2")
else:
    print("3")

Solution (Python):
print(len({n for n in input().split()}))

Solution (Python):
print(len({int(num) for num in input().split()}))

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

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

Solution (Python):
num_list = input().split()
num_before_list = []
count = 0

for num in num_list:
  if num in num_before_list:
    continue
  else:
    count += 1
    num_before_list.append(num)

print(count)

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

Solution (Python):
from sys import stdin
a = map(int,stdin.readline().split())
a = set(a)
print len(a)

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

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

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

print len(set(a))

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

Solution (Python):

s=set(raw_input().split())
print len(s)

Solution (Python):


colors = input().split()

bef = 0
count = 0
colors.sort()

for c in colors:
    if bef == 0:
        count += 1
        bef = c
    else:
        if c > bef:
            count += 1
            bef = c

print(count)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):

print len(set(raw_input().split()))

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

















print(len(set(A)))

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

Solution (Python):
cans = set(map(int, raw_input().split()))
print len(cans)

Solution (Python):
def ans():
	l = list(map(int, raw_input().split()))
	if l[0] == l[1] and l[1] == l[2]:
		print 1
		return 1
	elif l[0] == l[1] or l[1] == l[2] or l[2] == l[0]:
		print 2
		return 2
	else:
		print 3
		return 3

if __name__ == '__main__':
	ans = ans()

Solution (Python):

import collections
l = raw_input().split()
print len(collections.Counter(l).keys())

Solution (Python):
l=map(int, raw_input().split())

col=1

if l[1]!=l[0]:
	col+=1
if l[2]!=l[1] and l[2]!=l[0]:
	col+=1

print col

Solution (Python):


nums = list(map(int, input().split()))
a = nums[0]
b = nums[1]
c = nums[2]
count_a = nums.count(a)
count_b = nums.count(b)
count_c = nums.count(c)

list = [count_a, count_b, count_c]
ans = 4 - max(list)
print(ans)

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

def input_num():
    num = input().split()
    return num

def num_serch(num):
    penki_num = len(num)
    if num[0] == num[1]:
        penki_num = penki_num - 1
    if num[0] == num[2]:
        penki_num = penki_num - 1
    if num[1] == num[2]:
        penki_num = penki_num - 1

    if penki_num == 0:
        penki_num = penki_num + 1

    print(penki_num)

if __name__ == '__main__':
    num = input_num()
    num_serch(num)

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):
n = list(map(int, input().split()))
i = 3

if n[0] == n[1] :
    i -= 1

if n[0] == n[2] :
    i -= 1

elif n[1] == n[2] :
    i -= 1

print(i)

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

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

Solution (Python):
l = list(map(int,list(input().split())))
color = 0
bought = []

for i in l:
    if i not in bought:
        color += 1
        bought.append(i)

print(color)

Solution (Python):
a = input().split()
s = {a[0]}
for i in a:
    s |= {i}
print(len(s))

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

Solution (Python):
a,b,c = raw_input().split()
a=int(a)
b=int(b)
c=int(c)
A = {a:1,b:1,c:1}

print len(A)

Solution (Python):


mojir=input()
hyo=mojir.split(' ')
penki=set([int(mono) for mono in hyo])

print(len(penki))

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

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):
a, b, c = map(int, raw_input().split())
cnt = 3
if a == b:
    cnt-=1
if b == c:
    cnt-=1
if a == c:
    cnt-=1
if cnt==0:
    cnt=1
print cnt

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

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

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

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

Solution (Python):
n = input().split(' ')

if n[0] != n[1] != n[2] != n[0]:
    print(3)
elif n[0] == n[1] != n[2] != n[0]:
    print(2)
elif n[0] != n[1] == n[2] != n[0]:
    print(2)
elif n[2] == n[0] != n[1] != n[0]:
    print(2)
else:
    print(1)

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

Solution (Python):
l = raw_input().split()
map_ = {}
for data in l:
    map_[l[0]] = 1
    map_[l[1]] = 1
    map_[l[2]] = 1
print len(map_)

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

Solution (Python):

from collections import Counter
S = raw_input().strip().split()
print len(Counter(S))

Solution (Python):
import re
x = raw_input()
x = re.split(" ", x)
print len(set(x))

Solution (Python):
a, b, c = map(int, raw_input().split())
answer = 1
if b != a:
    answer += 1
if c != a and c != b:
    answer += 1
print answer

Solution (Python):
import sys

line = sys.stdin.readline()
line = line.rstrip().split(" ")
dic = {}
for i in line:
    dic[i] = 0

print (len(dic))

Solution (Python):



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


def main(a, b, c):
    return len({a, b, c})


print(main(a, b, c))

Solution (Python):
paints = raw_input().split()
paints_uniq = list(set(paints))
print(len(paints_uniq))

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

Solution (Python):
a=[int(i) for i in input().split()]
c=[]
d=0
for i in range(3):
    if not a[i] in c:
      d+=1
      c.append(a[i])
print(d)

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

Solution (Python):
penki = map(int, raw_input().split(" "))
a = penki[0]
b = penki[1]
c = penki[2]

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

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

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

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

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

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

Solution (Python):



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

Solution (Python):
d = list(map(int,input().split()))
dico = {}
for i in d:
	if i not in dico:
		dico[i] = 1
	else:
		dico[i] += 1

print(len(dico))

Solution (Python):
import re
import doctest


class IO_for_Contest(object):
    @staticmethod
    def my_input():
        
        return input()

    @staticmethod
    def read_from_input():
        return IO_for_Contest.read_n_int(3)

    @staticmethod
    def read_line():
        return IO_for_Contest.my_input().strip()

    @staticmethod
    def read_int():
        return int(IO_for_Contest.my_input().strip())

    @staticmethod
    def read_n_int(n):
        return list(map(
                    int,
                    re.split('\s+', IO_for_Contest.my_input().strip())))[: n]


def solve():
    buf = IO_for_Contest.read_from_input()
    a = buf[0]
    b = buf[1]
    c = buf[2]

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

if __name__ == '__main__':
    
    solve()

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

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

Solution (Python):
from sys import stdin

a = set((int(x) for x in stdin.readline().split()))

print(len(a))

Solution (Python):
A = [int(x) for x in raw_input().split()]
d = {}
for x in A:
    d[x] = 1
print len(d.keys())

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

Solution (Python):
A = [int(x) for x in raw_input().split()]
d = {}
for x in A:
    d[x] = 1
print len(d.keys())

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

Solution (Python):
from random import random
import math
import re
import fractions

A = map(int, raw_input().split(" "))
print len(set(A))

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

ans = 0

if a == b == c:
    ans = 1

elif a == b or b == c or c == a:
    ans = 2

else:
    ans = 3

print ans

Solution (Python):
import bisect
import sys
import math
import itertools
sys.setrecursionlimit(10000)

INF = float('inf')


def i():
    return int(raw_input())
def ii():
    return map(int,raw_input().split(" "))
def s():
    return raw_input()
def ss():
    return raw_input().split(" ")
def slist():
    return list(raw_input())


def join(s):
    return ''.join(s)


def piter(n,m):
    return itertools.permutations(n,m)
def citer(n,m):
    return itertools.combinations(n,m)


def modc(a,b,m):
    c = 1
    for i in xrange(b):
        c = c * (a - i) % m
        c = c * modinv(i + 1,m) % m
    return c
 
def gcd(a, b):
    (x, lastx) = (0, 1)
    (y, lasty) = (1, 0)
    while b != 0:
        q = a // b
        (a, b) = (b, a % b)
        (x, lastx) = (lastx - q * x, x)
        (y, lasty) = (lasty - q * y, y)
    return (lastx, lasty, a)
 
def modinv(a, m):
    (inv, q, gcd_val) = gcd(a, m)
    return inv % m


def index(a, x):
    
    i = bisect_left(a, x)
    if i != len(a) and a[i] == x:
        return i
    return -1


def memoize(f):
    cache = {}
    def helper(*args):
        if args not in cache:
            cache[(args)] = f(*args)
        return cache[args]
    return helper

@memoize
def nck(a,b,m):
    b = min([a-b,b])
    if (b>a or b<0 or a<0):
        return 0
    elif a == 0:
        return 1
    return (nck(a-1,b-1,m)+nck(a-1,b,m)) % m

nh=zip([1,0,-1,0],[0,1,0,-1])



a,b,c=ii()

x=[a]
if b not in x:
    x.append(b)
if c not in x:
    x.append(c)

print len(x)

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

Solution (Python):


c = list(map(lambda x: int(x), input().split()))

print(len(set(c)))

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

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

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