def factorSearcher(num):
    remain=num
    currentNum=2
    factors=set()
    if num>=2:
        while remain>1:
            if remain%currentNum==0:
                factors.add(currentNum)
                remain=remain/currentNum
                currentNum=2
            else:
                currentNum+=1
    return len(factors)

"""
def background_factorSearcher(n):
    import time
    a=time.time()
    
    primes=[True]*(n+1)
    primes[0],primes[1]=False,False
    num=2
    while num1:
        for j in range(pivot+1,len(string)):
            result[j]=abs(int(string[pivot])-int(string[j]))
    answer=""
    for item in result:
        answer+=str(item)
    print(int(answer))