def method():
    print("find the thirteen adjacent digits in the following 1000 digit number that have the greatest product")

    digits = "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858" \
             "6156078911294949545950173795833195285320880551112540698747158523863050715693290963295227443043557668966" \
             "4895044524452316173185640309871112172238311362229893423380308135336276614282806444486645238749303589072" \
             "9629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010" \
             "5336788122023542180975125454059475224352584907711670556013604839586446706324415722155397536978179778461" \
             "7406495514929086256932197846862248283972241375657056057490261407972968652414535100474821663704844031998" \
             "9000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294" \
             "7654568284891288314260769004224219022671055626321111109370544217506941658960408071984038509624554443629" \
             "8123098787992724428490918884580156166097919133875499200524063689912560717606058861164671094050775410022" \
             "5698315520005593572972571636269561882670428252483600823257530420752963450"

    size = 13

    total_product = 0
    thirteen_digits = [0] * size

    # iterate through each char/digit in the string
    for i in range(len(digits) - size):

        # set each of the thirteen digits based on current index i and multiply them
        prod = 1
        for j in range(size):
            thirteen_digits[j] = int(digits[i+j])
            prod *= thirteen_digits[j]

        if prod > total_product:
            total_product = prod

    print(total_product)
    return

3c388a9b45073ce16b100c85581a915ed37b34c3
<mask token>

def method():
    print(
        'find the thirteen adjacent digits in the following 1000 digit number that have the greatest product'
        )
    digits = (
        '7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450'
        )
    size = 13
    total_product = 0
    thirteen_digits = [0] * size
    for i in range(len(digits) - size):
        prod = 1
        for j in range(size):
            thirteen_digits[j] = int(digits[i + j])
            prod *= thirteen_digits[j]
        if prod > total_product:
            total_product = prod
    print(total_product)
    return

def method():
    print("find the thirteen adjacent digits in the following 1000 digit number that have the greatest product")

    digits = "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858" \
             "6156078911294949545950173795833195285320880551112540698747158523863050715693290963295227443043557668966" \
             "4895044524452316173185640309871112172238311362229893423380308135336276614282806444486645238749303589072" \
             "9629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010" \
             "5336788122023542180975125454059475224352584907711670556013604839586446706324415722155397536978179778461" \
             "7406495514929086256932197846862248283972241375657056057490261407972968652414535100474821663704844031998" \
             "9000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294" \
             "7654568284891288314260769004224219022671055626321111109370544217506941658960408071984038509624554443629" \
             "8123098787992724428490918884580156166097919133875499200524063689912560717606058861164671094050775410022" \
             "5698315520005593572972571636269561882670428252483600823257530420752963450"

    size = 13

    total_product = 0
    thirteen_digits = [0] * size

    # iterate through each char/digit in the string
    for i in range(len(digits) - size):

        # set each of the thirteen digits based on current index i and multiply them
        prod = 1
        for j in range(size):
            thirteen_digits[j] = int(digits[i+j])
            prod *= thirteen_digits[j]

        if prod > total_product:
            total_product = prod

    print(total_product)
    return
