Identify Smith Numbers

 1 def sum_digits(n):
 2     return sum(int(x) for x in str(n))
 3 
 4 def prime_factors(n):
 5     factors = []
 6     for i in xrange(2, n):
 7         if i*i > n:
 8             break
 9         elif n % i == 0: # 短除法核心
10             while n % i == 0:
11                 factors.append(i)
12                 n /= i
13     if n > 1:
14         factors.append(n) 
15     return factors
16 
17 n = int(raw_input())
18 
19 factors = prime_factors(n)
20 print ‘1‘ if len(factors) > 1 and sum_digits(n) == sum(sum_digits(x) for x in factors) else ‘0‘