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):
import sys
from collections import defaultdict, deque
import math








input = sys.stdin.readline

getS = lambda: input().strip()
getN = lambda: int(input())
getList = lambda: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]

INF = 10 ** 20
MOD = 10**9 + 7

def divide(k):
    return pow(k, MOD-2, MOD)


def make_nck(n):
    ret = [1]
    for i in range(1, n+1):
        ret.append((ret[-1] * (n + 1 - i) * divide(i)) % MOD)

    
    return ret

def make_nigojyo(n):
    ret = [1]

    for i in range(1, n+1):
        ret.append((ret[-1] * 25) % MOD)

    
    return ret


def solve():
   a = getList()
   print(len(list(set(a))))



def main():
    n = getN()
    for _ in range(n):
        solve()


if __name__ == "__main__":
    
    solve()

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

Solution (Python):
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
from math import gcd,ceil,floor,factorial

from functools import reduce
from pprint import pprint
from statistics import mean,median,mode

INF = float("inf")

def mycol(data,col):
    return [ row[col] for row in data ]

def mysort(data,col,reverse_flag):
    data.sort(key=lambda x:x[col],reverse=reverse_flag)
    return data

def mymax(data):
    M = -1*float("inf")
    for i in range(len(data)):
        m = max(data[i])
        M = max(M,m)
    return M

def mymin(data):
    m = float("inf")
    for i in range(len(data)):
        M = min(data[i])
        m = min(m,M)
    return m

def mycount(ls,x):
    
    l = bisect_left(ls,x)
    r = bisect_right(ls,x)
    return (r-l)

def myoutput(ls,space=True):
    if space:
        if len(ls)==0:
            print(" ")
        elif type(ls[0])==str:
            print(" ".join(ls))
        elif type(ls[0])==int:
            print(" ".join(map(str,ls)))
        else:
            print("Output Error")
    else:
        if len(ls)==0:
            print("")
        elif type(ls[0])==str:
            print("".join(ls))
        elif type(ls[0])==int:
            print("".join(map(str,ls)))
        else:
            print("Output Error")

def I():
    return int(input())

def MI():
    return map(int,input().split())

def RI():
    return list(map(int,input().split()))

def CI(n):
    return [ int(input()) for _ in range(n) ]

def LI(n):
    return [ list(map(int,input().split())) for _ in range(n) ]

def S():
    return input()

def MS():
    return input().split()

def RS():
    return list(input().split())

def CS(n):
    return [ input() for _ in range(n) ]

def LS(n):
    return [ list(input().split()) for _ in range(n) ]







a,b,c = MI()
l = [a,b,c]
print(len(set(l)))

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

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


if __name__ == '__main__':
    main()

Solution (Python):


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


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


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

Solution (Python):
def paint():
    s = input()
    slist = s.split(' ')

    a = int(slist[0])
    b = int(slist[1])
    c = int(slist[2])
    count = 1
    if a != b:
        count += 1
    if a != c and b != c:
        count += 1

    print(count)

paint()

Solution (Python):

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

print(len(set(lst)))

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

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

if __name__ == '__main__':
    main()

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

print(len(set(a)))

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):
import sys
import numpy as np
import random
from decimal import Decimal
import itertools
import re
import bisect
from collections import deque, Counter
from functools import lru_cache

sys.setrecursionlimit(10**9)
INF = 10**13
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
def SERIES(n): return np.fromstring(sys.stdin.buffer.read(), dtype=np.int32, sep=' ')
def GRID(h,w): return np.fromstring(sys.stdin.buffer.read(), dtype=np.int32, sep=' ').reshape(h,-1)[:,:w]
def GRIDfromString(h,w): return np.frombuffer(sys.stdin.buffer.read(), 'S1').reshape(h,-1)[:,:w]
MOD = 1000000007

def main():
	abc = set(LI())
	print(len(abc))




if __name__ == '__main__':
    main()

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

Solution (Python):


"""
int 
float 


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

print(a)
ptrint("Hello")

for name in fruits: 
    print(name)

list0 = [] 
list0 = [1,2,3,4] 
list0 = [0]*10 
list1 = list(map(int, input().split()))　
list1 = list1 + [6, 7, 8] 
list2.append(34) 
list.insert(3,10) 
len(list4) 
max(sa) 
list5.count(2) 
abs(a) 
max(a,b) min(a,b) 

extension_1 = []
for i in range(10):
    extension_1.append(i)
extension_1


comprehension_1= [i for i in range(10)]
comprehension_1

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

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

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

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

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

Solution (Python):
import collections

a = list(input().split())
ans = len(collections.Counter(a))
print(ans)

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7


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


if __name__ == '__main__':
    resolve()

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

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

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

Solution (Python):
print(len(set(map(int, 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 c != a:
  print(3)
else:
  print(2)

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

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):
import collections
A = input().split()
c = collections.Counter(A)
print(len(c))

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

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

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

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

print(len(set(arr)))

Solution (Python):
ns=input()

nsl=ns.split(' ')

nsc=[]
for i in range(3):
  nsc.append(nsl.count(nsl[i]))

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

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

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

set_list_penki = list(set(list_penki))

print(len(set_list_penki))

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    abc=MI()
    s=set(abc)
    print(len(s))

main()

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) or (b==c and c!=a) or (c==a and a!=b):
  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 collections
list = list(input().split())
l=collections.Counter(list)
print(len(l))

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

Solution (Python):
import sys
def v():
    x=[x for x in sys.stdin.readline().split()]
    print(len(set(x)))
if __name__=='__main__':v()

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

Solution (Python):
s=list(map(int,input().split()))
a=sorted(s)
if a[0]<a[1]:
  if a[1]<a[2]:
    c=3
  else:
    c=2
else:
  if a[1]<a[2]:
    c=2
  else:
    c=1
print(c)

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

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

Solution (Python):

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

S = 1

if not a == b:
    S = S + 1

if not a == c and not b == c:
    S = S + 1

print(S)

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

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

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

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

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

Solution (Python):

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

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

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

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

print(len(A))

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

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

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

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

Solution (Python):
l = input()
arr = l.split(' ')
s = set()
if 1 <= int(arr[0]) <= 100 and 1 <= int(arr[1]) <= 100 and 1 <= int(arr[2]) <= 100:
  for e in arr:
    s.add(e)
s = list(s)
print(len(s))

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

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

Solution (Python):
"""
N = list(map(int,input().split()))
S = [str(input()) for _ in range(N)]
S = [list(map(int,list(input()))) for _ in range(h)] 
print(*S,sep="")
"""

import sys
sys.setrecursionlimit(10**6)
input = lambda: sys.stdin.readline().rstrip()
inf = float("inf") 
s = set(map(int,input().split()))
print(len(s))

Solution (Python):
import sys
import math
 
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
 
def main():
    s = map(int,input().split())
    print(len(set(s)))
    
if __name__ == '__main__':
    main()

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

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

print(a)

Solution (Python):
a,b,c = map(int,input().split())
d =[]
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 = map(int, input().split())
cnt = 0
if a != b:
  cnt += 1
if a != c:
  cnt += 1
if b != c:
  cnt += 1
if a==c and b==c:
  cnt += 1
print(int(cnt))

Solution (Python):
a,b,c=(int(x) for x 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 and b==c and a==c):
  print(1)
elif(a==b and b!=c):
  print(2)
elif(b==c and c!=a):
  print(2)
elif(c==a and a!=b):
  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==c:
    print(1)

elif a!=b!=c!=a:
    print(3)

else:
    print(2)

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

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

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

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

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

if a == 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):
A = list(map(int, input().split()))
if A.count(A[0]) == 3:
    print("1")
elif A.count(A[0]) == 2:
    print("2")
elif A.count(A[0]) == 1:
    if A.count(A[1]) == 1:
        print("3")
    else:
        print("2")

Solution (Python):
a,b,c = list(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):
a=list(map(int,input().split()))
a.sort()
count=1
for i in range(2):
    if a[i]!=a[i+1]:
        count+=1
print(count)

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

Solution (Python):
penki = [i for i in map(int, input().split())]
count = 3
if penki[0] == penki[1]:
    count -= 1
if penki[0] == penki[2]:
    count -= 1
if penki[1] == penki[2]:
    count -= 1
if penki[1] == penki[2] == penki[0]:
    count += 1
print(count)

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

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

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

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

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

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

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

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

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

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

Solution (Python):
x, y, z = map(int, input().split())
count = 1
if x != y:
    count += 1
if x != z and y != z:
    count += 1
print(count)

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

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

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

if __name__ == '__main__':
    main()

Solution (Python):
from sys import stdin

l = set(map(int,stdin.readline().rstrip().split()))

print(len(l))

Solution (Python):
a = input().split()
li = []
for i in a:
    if i not in li:
        li.append(i)
print(len(li))

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

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

s = set(abc)
print(len(s))

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

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

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

abc = [a,b,c]

abc=set(abc)

print(len(abc))

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

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

Solution (Python):


import sys



























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, b, c = mi()
    print(len(list(set([a, b, c]))))


if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):
a = input().split()
b = 3
if a[0] == a[1] and a[0] == a[2] and a[1] == a[2]:
    b = 1
elif a[0] != a[1] and a[0] == a[2] and a[1] != a[2]:
    b = 2
elif a[0] == a[1] and a[0] != a[2] and a[1] != a[2]:
    b = 2
elif a[0] != a[1] and a[0] != a[2] and a[1] == a[2]:
    b = 2
elif a[0] != a[1] and a[0] != a[2] and a[1] != a[2]:
    b = 3
print(b)

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

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

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

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

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

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

Solution (Python):
def main():
 num = list(map(int,input().split()))
 ans = 1 ;
 if num[0]!=num[1]:
  ans+=1
 if num[0]!=num[2] and num[1]!=num[2]:
  ans+=1
 print(ans)
 
main()

Solution (Python):

"""
Created on Thu May 14 18:26:24 2020

@author: shinba
"""

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

print(len(A))

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

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

Solution (Python):






import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr


def lcm(a, b):
    return a * b // gcd (a, b)





s = inputIL()
print(len(set(s)))

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

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

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

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

Solution (Python):
import sys
import math
import bisect
 
def main():
    A = list(map(int, input().split()))
    print(len(set(A)))
 
if __name__ == "__main__":
    main()

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
A = LIST()
print(len(set(A)))

Solution (Python):

colors = input().split()
arr = {}
for color in colors:
    arr[color] = 1

print(len(arr))

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):
import sys
input = sys.stdin.readline

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

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

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

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

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9+7

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

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

color_list = set(color_list)
print(len(color_list))

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

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

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

print(ans)

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

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

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

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

Solution (Python):
abc_list = list(map(int,input().split()))
abc_list_len = len(abc_list)
dum = set(abc_list)
dum_len = len(dum)
print(dum_len)

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

print(len(abc))

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

print(len(set(ans)))

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

if __name__ == '__main__':
    main()

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

print(len(set(abc)))

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

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

Solution (Python):

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

list = [a, b, c]

print(len(list) if len(list)==len(set(list)) else len(set(list)) )

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

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

Solution (Python):
lst=(list(map(str,input().split())))
a=set()
for i in range(3):
  a.add(lst[i])
print(len(a))

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

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

Solution (Python):


abc = input()

ls_abc = abc.split()
len_abc = len(ls_abc)

for i in range(len_abc):
    ls_abc[i] = int(ls_abc[i])



counter = {}

for i in range(len_abc):
    x = ls_abc[i]

    if not x in counter:
        counter[x] = 0

    counter[x] = counter[x] + 1

print(len(counter))

Solution (Python):


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

print(len(s))

Solution (Python):

def ABC_46_A():
    A,B,C = map(int, input().split())
    iroha = [0 for i in range(3)]
    iroha = []
    iroha.append(A)
    iroha.append(B)
    iroha.append(C)

    if iroha.count(A)==3:
        print(1)
    elif iroha.count(A)==2 or iroha.count(B)==2:
        print(2)
    else:
        print(3)

if __name__ == '__main__':

    ABC_46_A()

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

Solution (Python):
if __name__ == '__main__':
    print(len(list(set(list(map(int, 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):
s = set(input().split())
print(len(s))

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

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

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

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

Nlis= [a, b, c]

print(len(set(Nlis)))

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

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

Solution (Python):
s=list(map(int, open(0).read().split()));print(len(set(s)))

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
import sys
def I(): return int(input())  
def Is(): return map(int, input().split())  
def LI(): return list(map(int, input().split()))  
def TI(): return tuple(map(int, input().split()))  
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()  
def LS(): return list(input())  
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(1000000)
MOD = 1000000007
INF = float('inf')

a, b, c = Is()
s = set()
s.add(a)
s.add(b)
s.add(c)
print(len(s))

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

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

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

Solution (Python):
a,b,c=input().split()
d=[a,b,c]
for i in range(2):
    if d.count(d[i])!=1:
        del d[i]
print(len(d))

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

Solution (Python):

def resolve():
    colors = input().split()
    print(len(set(colors)))
    
    


if '__main__' == __name__:
    resolve()

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

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

list = [a,b,c]

num = len(set(list))

print(num)

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

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

Solution (Python):


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

Solution (Python):
c=dict.fromkeys(list(map(str,input().split())))
print(len(c))

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