def adjacentMultiply(n,r):
    """Takes in a really large number, n,
    and looks for the r-th adjacent digits with
    the largest product"""
    maxProd = 1
    nStr = str(n)
    nStrLen = len(nStr)
    for chunkIdx in range(nStrLen - r + 1):
        subStr= nStr[chunkIdx:chunkIdx+r]
        subProd=1
        for digit in subStr:
            subProd *= int(digit)
            if subProd>maxProd:
                maxProd=subProd
    return maxProd