project euler Problem 36

def Judge(n):
    bstr=bin(n)
    bstr=bstr[2:]
    ostr=str(n)
    flag1=True
    flag2=True
    for i in range(len(bstr)):
        if bstr[i]!=bstr[len(bstr)-i-1]:
            flag1=False
            break
    for i in range(len(ostr)):
        if ostr[i]!=ostr[len(ostr)-i-1]:
            flag2=False
            break
    return flag1 and flag2

sum=0
for i in range(1,1000000):
    if Judge(i):
        sum+=i

print sum