from time import time

from functools import reduce

from operator import mul

from script.maths import gcd,isprime2,isprime3

#from script.allsieve import primesfrom2to as sieve

from script.allsieve import soe as sieve

from script.memorize import *

from script.helpers import totient as t1

def e214(n=25,t = 4*10**7):

return count

@memo

def chain(n):

if n == 1:return 1

n = totient(n)

return 1+chain(n)

@memo

def totient(n):

return reduce(mul, ((x-1) * x ** (exp-1) for x, exp in primetree(n)),1)#factorize

def primetree(n):

tree = fsandexp(n,[])

x = list(set(tree))

return [[x[i],tree.count(x[i])] for i in range(len(x))]

@memo1of2

def fsandexp(n,pfs=[]):

return [i]+fsandexp(n,pfs)

if __name__=='__main__':

'''

x = 1000

t = time()

for i in range(1,x):

a = totient(i)

print(time()-t)

t = time()

for i in range(1,x):

a = t1(i)

print(time()-t)

'''

print(e214())