wechall - Prime Factory

#coding:utf-8

import math

def is_prime(number):
    for i in range(2,(int)(math.sqrt(number)+1)):
        if(number%i == 0):
            return 0
    return 1

def add_bit(number):
    sum_bit=0
    while number != 0:
        a = number%10
        sum_bit+=a
        number=number/10
    return sum_bit

if __name__ == '__main__':
    count = 0
    for number in xrange(1000000,2000000):
        addnumber = add_bit(number)
        if is_prime(number) and is_prime(addnumber):
            if count < 2:
                print number
                count += 1
            else:
                exit(0)