The written representation of a number (with 4 or more digits) can be split into three parts in various different ways. For example, the written number 1234 can be split as [1 | 2 | 34] or [1 | 23 | 4] or [12 | 3 | 4].
Given a written number, find the highest possible product from splitting it into three parts and multiplying those parts together. For example:
- product of [1 | 2 | 34] = 1 \* 2 \* 34 = 68
- product of [1 | 23 | 4] = 1 \* 23 \* 4 = 92
- product of [12 | 3 | 4] = 12 \* 3 \* 4 = 144
So maximumProductOfParts(1234) = 144
For a longer string there will be many possible different ways to split it into parts. For example, 8675309 could be split as: 
- [8 | 6 | 75309] 
- [867 | 530 | 9] 
- [8 | 67 | 5309]
- [86 | 75 | 309]
or any other option that splits the string into three parts each containing at least one digit.
def maximum_product_of_parts(n):
    n = str(n)
    s=[]
    for i in range(1,len(n)-1):
        for h in range(i+1,len(n)):
            f,m,l = int(n[0:i]),int(n[i:h]),int(n[h:])
            s.append(f*m*l)
    return max(s)
def maximum_product_of_parts(n):
    n = str(n)
    s=[]
    for i in range(1,len(n)-1):
        for h in range(i+1,len(n)):
            f,m,l = int(n[0:i]),int(n[i:h]),int(n[h:])
            s.append(f*m*l)
    return max(s)