def BaseConvert(n, b):
    k = 1
    x = []
    while b**(k-1) < n:
        d = (n % b**k)
        n -= d
        x.append(d/b**(k-1))
        k += 1
    return x
 
def FouriestTransform(n):
    maxfours = 0
    b = 5
    while 4*b**(maxfours) < n and b < n:
        fours = BaseConvert(n,b).count(4)
        if fours > maxfours:
            maxfours = fours
        b += 1
    return maxfours
 
print FouriestTransform(1524)
print FouriestTransform(66)# your code goes here

ZGVmIEJhc2VDb252ZXJ0KG4sIGIpOgogICAgayA9IDEKICAgIHggPSBbXQogICAgd2hpbGUgYioqKGstMSkgPCBuOgogICAgICAgIGQgPSAobiAlIGIqKmspCiAgICAgICAgbiAtPSBkCiAgICAgICAgeC5hcHBlbmQoZC9iKiooay0xKSkKICAgICAgICBrICs9IDEKICAgIHJldHVybiB4CiAKZGVmIEZvdXJpZXN0VHJhbnNmb3JtKG4pOgogICAgbWF4Zm91cnMgPSAwCiAgICBiID0gNQogICAgd2hpbGUgNCpiKioobWF4Zm91cnMpIDwgbiBhbmQgYiA8IG46CiAgICAgICAgZm91cnMgPSBCYXNlQ29udmVydChuLGIpLmNvdW50KDQpCiAgICAgICAgaWYgZm91cnMgPiBtYXhmb3VyczoKICAgICAgICAgICAgbWF4Zm91cnMgPSBmb3VycwogICAgICAgIGIgKz0gMQogICAgcmV0dXJuIG1heGZvdXJzCiAKcHJpbnQgRm91cmllc3RUcmFuc2Zvcm0oMTUyNCkKcHJpbnQgRm91cmllc3RUcmFuc2Zvcm0oNjYpIyB5b3VyIGNvZGUgZ29lcyBoZXJl