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):
listA = list(map(int, input().split()))
listB = []

index=0
while index < len(listA):
    if listA[index] in listB:
        pass
    else:
        listB.append(listA[index])
    index+=1
print(len(listB))

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

print(len(set(abc)))

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

print(len(b))

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

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

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

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

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

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

Solution (Python):

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

Solution (Python):
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


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


if __name__ == '__main__':
    main()

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

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

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

print(len(set(l)))

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

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

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

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

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

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

S.add(a)
S.add(b)
S.add(c)

print(len(S))

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

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

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

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

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

p_cnt  =len(set(paints))

print(p_cnt)

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

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

Solution (Python):


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

print(len(s))

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

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

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

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

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

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

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

Solution (Python):



def main():
    print(len(set(map(int, raw_input().split()))))


if __name__ == "__main__":
    main()

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

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

Solution (Python):
import sys
import math
import collections
import itertools
import array
import inspect


sys.setrecursionlimit(1000000)



def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))



def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]


def gcd(n, m):
    if n % m == 0:
        return m
    else:
        return gcd(m, n % m)


def gcd_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = gcd(v, L[i])

    return v


def lcm(n, m):
    return (n * m) // gcd(n, m)


def lcm_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = lcm(v, L[i])

    return v



def wfs_d(D, N, K):
    """
    D: 隣接行列(距離付き)
    N: ノード数
    K: 始点ノード
    """

    dfk = [-1] * (N + 1)
    dfk[K] = 0

    cps = [(K, 0)]
    r = [False] * (N + 1)
    r[K] = True
    while len(cps) != 0:
        n_cps = []
        for cp, cd in cps:
            for i, dfcp in enumerate(D[cp]):
                if dfcp != -1 and not r[i]:
                    dfk[i] = cd + dfcp
                    n_cps.append((i, cd + dfcp))
                    r[i] = True

        cps = n_cps[:]

    return dfk



def dfs_d(v, pre, dist):
    """
    v:  現在のノード
    pre: １つ前のノード
    dist: 現在の距離

    以下は別途用意する
    D: 隣接リスト(行列ではない)
    D_dfs_d: dfs_d関数で用いる，始点ノードから見た距離リスト
    """

    global D
    global D_dfs_d

    D_dfs_d[v] = dist

    for next_v, d in D[v]:
        if next_v != pre:
            dfs_d(next_v, v, dist + d)

    return


def sigma(N):
    ans = 0
    for i in range(1, N + 1):
        ans += i
    return ans


class Combination:
    def __init__(self, n, mod):

        g1 = [1, 1]
        g2 = [1, 1]
        inverse = [0, 1]
        for i in range(2, n + 1):
            g1.append((g1[-1] * i) % mod)
            inverse.append((-inverse[mod % i] * (mod // i)) % mod)
            g2.append((g2[-1] * inverse[-1]) % mod)
        self.MOD = mod
        self.N = n
        self.g1 = g1
        self.g2 = g2
        self.inverse = inverse

    def __call__(self, n, r):
        if (r < 0 or r > n):
            return 0
        r = min(r, n - r)
        return self.g1[n] * self.g2[r] * self.g2[n - r] % self.MOD




dp = None


def main():
    print(len(set(li_input())))


main()

Solution (Python):
print(len({i for i in 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):
a,b,c=map(int,input().split())
ans=0
if a==b:
    ans+=1
    if b!=c:
        ans+=1
else:
    ans+=2
    if c not in [a,b]:
        ans+=1
print(ans)

Solution (Python):


def main():
    arry = list(input().split())
    print(len(set(arry)))

if __name__ == '__main__':
    main()

Solution (Python):

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

Solution (Python):

"""
Created on Sat Aug 11 14:28:39 2018
ABC046A
@author: maezawa
"""

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

Solution (Python):

def main():
    a , b , c = map(str,(input().split(' ')))
    result = 3
    if a == b:
        result = result - 1
    if a == c:
        result = result -1
    if b == c:
        result = result - 1

    if result == 0:
        print("1")
    else:
        print(result)



if __name__ == '__main__':
    main()

Solution (Python):
from sys import stdin


def main():
    a, b, c = [int(x) for x in stdin.readline().rstrip().split()]
    spam = set([a, b, c])
    print(len(spam))


if __name__ == '__main__':
    main()

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

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

Solution (Python):
a,b,c=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):
print(len({i for i in input().split()}))

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

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

print(len(set(abc)))

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

l=set(a)

print(len(l))

Solution (Python):
bought,bought_1,bought_2 = map(int,input().split())
lis = set([bought,bought_1,bought_2])
print(len(lis))

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

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

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

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

Solution (Python):

n=[int(i) for i in input().split()]
count=3
n.sort()
for i in range(2):
  if(n[i]==n[i+1]):
    count-=1
print(count)

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

Solution (Python):
abc = list(map(int, input().split()))
penki = {}
for i in range(3):
    if not abc[i] in penki.keys():
        penki[abc[i]] = 1
    else:
        continue
print(len(penki.keys()))

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

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

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

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

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

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

count = 0
if a != b:
    count = count + 1
if a != c:
    count = count + 1
if b != c:
    count = count + 1

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

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

print(len(set(List)))

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

Solution (Python):


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

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

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

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

if a==b and b==c and a==c:
    res = 1
elif a==b or b==c or a==c:
    res = 2
else:
    res = 3

print(int(res))

Solution (Python):
a, b, c = 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)

Solution (Python):


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

print(len(set(abc)))

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

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

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

a=1
for j in range(1,len(t)):
    if t[j-1]<t[j]:
        a=a+1
print(a)

Solution (Python):
from collections import Counter
cs=map(int,raw_input().split())
c = Counter(cs)
print len(c)

Solution (Python):


























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

Solution (Python):


























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

Solution (Python):


























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

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

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

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

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

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

Solution (Python):
a,b,c=input().split();print([3,2,0,1][(a==b)+(b==c)+(c==a)])

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

Solution (Python):



C = input().split()
a = C[0]
b = C[1]
c = C[2]

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

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

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

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

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

Solution (Python):
l = list(map(int,input().split()))
k=0
if l[0]== l[1]==l[2]:
    k+=1
if l[0]!=l[1]:
    k+=1
if l[1]!=l[2]:
    k+=1
if l[2]!=l[0]:
    k+=1
if k>3:
    k=3
print('{}'.format(k))

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

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

print(len(list(set(numlist))))

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

if (a[0] == a[1]):
  if (a[1] == a[2]):
    sum = 1
  else:
    sum = 2
elif (a[0] == a[2]):
  sum = 2
elif (a[1] == a[2]):
  sum = 2
else:  
  sum = 3

print(sum)

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

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

Solution (Python):


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

p = 3
if a==b:
    p = p-1
    if b==c:
        p = p-1
    else:
        pass
elif b==c:
    p = p-1
elif a==c:
    p = p-1
else:
    pass

print(p)

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

Solution (Python):
print(len(set(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):
paint = raw_input().split()
ans = 3
if paint[0] == paint[1]:
	if paint[1] == paint[2]: ans = 1
	else: ans = 2
elif paint[0] == paint[2] or paint[1] == paint[2]: ans = 2

print ans

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

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

Solution (Python):
penki = list(map(int, input().split()))
kind = []
for i in penki:
	if not i in kind:
		kind.append(i)
print(len(kind))

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

Solution (Python):


import collections

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

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

Solution (Python):
A,B,C=map(int,input().split())
colors=[A,B,C]
if colors.count(A)==1 and colors.count(B)==1:
    print (3)
elif colors.count (A)==3:
    print (1)
else:
    print (2)

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

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

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

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

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

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

print(len(N))

Solution (Python):
from collections import Counter
A,B,C = map(int,input().split())
print(len(Counter([A,B,C]).most_common()))

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

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

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

Solution (Python):





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

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

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 math
import sys

def getinputdata():

    
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()

a = int(arr_data[0][0])
b = int(arr_data[0][1])
c = int(arr_data[0][2])

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

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

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

Solution (Python):
[a, b, c] = [int(x) for x in 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):
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 and a!=c:
  print(3)
else:
  print(2)

Solution (Python):
from collections import Counter

colours = Counter(list(map(int, input().split())))
print(len(list(colours)))

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())
color = [a]
if b not in color:
  color.append(b)
if c not in color:
  color.append(c)
print(len(color))

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

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

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

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):
import collections
dic = collections.defaultdict(lambda: 0)

for i in map(int, input().split()):
    dic[i] += 1

print(len(list(dic.keys())))

Solution (Python):
a,b,c=map(int, input().split())
list=[a,b,c]
list.sort()
if list[0]==list[1]==list[2]:
    print(1)
elif list[1]==list[0] or list[1]==list[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,b,c=map(int,input().split())
v=set([a,b,c])
print(len(v))

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

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

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

    ans = len(set(abc))
    print(ans)


if __name__ == '__main__':
    main()

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

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

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

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

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

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

if x == y == z:
    print ("1")
elif x == y or y == z or x == z:
    print ("2")
elif x != y != x:
    print ("3")

Solution (Python):





def main():
    s = set(map(int, input().split()))
    ans = len(s)
    print(ans)

if __name__ == "__main__": main()

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

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

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

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

Solution (Python):
import sys
a, b, c = map(int, sys.stdin.readline().split())
nums = []
nums.append(a)
nums.append(b)
nums.append(c)

counted = []
cnt = 0
for item in nums:
    if item in counted:
        continue
    else:
        cnt += 1
        counted.append(item)
print(cnt)

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

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

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

if a != b == c:
	print(2)

if a == b != c:
	print(2)
	
if a == c != b:
	print(2)

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

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

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

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

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

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


if __name__ == "__main__":
    main()

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

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

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

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

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

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

Solution (Python):

import math
import sys
import itertools
import numpy as np
import functools
import collections
mo = 1000000007
INF = 10**100
r = range

class infix(object):
    def __init__(self, function):
        self.function = function

    def __ror__(self, other):
        self.left = other
        return self

    def __or__(self, other):
        return self.function(self.left, other)

    def __call__(self, value1, value2):
        return self.function(value1, value2)

@infix
def c(f_t_u, f_u_r): return lambda t: f_u_r(f_t_u(t))

class _Ap(object):
    def __rlshift__(self, other):
        self.value = other
        return self

    def __rshift__(self, other):
        return other(self.value)
Ap = _Ap()
ap = Ap






a = map(int,input().split())<<ap>>(sorted)
if a[0] == a[1] and a[1] == a[2]:
    print(1);
elif a[0] != a[1] and a[1] != a[2]:
    print(3);
else:
    print(2);

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

Solution (Python):


a,b,c=list(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 = input().split()
tap = {a,b,c}
print (len(tap))

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

cnt = 0
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):
ans = list(map(int, input().split()))
ANS = set(ans)
print(len(ANS))

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

Solution (Python):
from sys import stdin, stdout
def readLine_int_set(): return set(list(map(int, stdin.readline().split())))
def main():
    print(len(readLine_int_set()))
    
if __name__ == "__main__":
    main()

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 c != a:
    print 3
else:
    print 2

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

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

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

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

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

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

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

Solution (Python):

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

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

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

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

a = []
for i in range(3):
	if input_line1[i] not in a:
		a.append(input_line1[i])
print len(a)

Solution (Python):
abc = list(map(int, input().split()))
color_list = []
for i in abc:
    if not i in color_list:
        color_list.append(i)
print(len(color_list))

Solution (Python):
from collections import defaultdict


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


if __name__ == '__main__':
    main()

Solution (Python):
import numpy as np
a = list(map(int, input().split()))

a = np.asarray(a)
print(len(np.unique(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 a==c:
    print("2")

else:
    print("3")

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

Solution (Python):
def ri(): return int(input())
def rli(): return list(map(int, input().split()))
def ris(): return list(input())
def pli(): return "".join(list(map(str, ans)))

print(len(set(rli())))

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

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

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

Solution (Python):
A,B,C = [int(i) for i in 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 ini(): return int(input())
def inli(): return list(map(int, input().split()))
def inf(): return float(input())
def inlf(): return list(map(float, input().split()))
def inl(): return list(input())
def pli(): return "".join(list(map(str, ans)))
x = inli()
x = list(set(x))
print(len(x))

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

Solution (Python):
a, b, c = [int(i) for i in 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, raw_input().split())
d = {a,b,c}
print len(d)

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

b = set(a)

print(len(b))

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

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

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

    print(ans)

if __name__ == '__main__':
    solve()

Solution (Python):
print len(set(map(int, raw_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):
colors = [int(i) for i in input().split()]
s_colors = set(colors)
print(len(s_colors))

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):
paints = set(int(i) for i in input().split())
print(len(paints))

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

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

lis = [a, b, c]
lis.sort()
if lis[0] == lis[2]:
    print("1")
elif (lis[0] != lis[1]) and (lis[1] != lis[2]):
    print("3")
else:
    print("2")

Solution (Python):
l=map(int,raw_input().split())
c=3
for i in l:
    if l.count(i)==3:
        c= 1
        break
    elif l.count(i)==2:
        c= 2
        break
print c

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

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

Solution (Python):


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


if __name__ == '__main__':
    main()

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

Solution (Python):
import sys

def debug(x, table):
    for name, val in table.items():
        if x is val:
            print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)
            return None

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


if __name__ == '__main__':
    solve()

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

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

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