题解 | #公共子串计算#

import sys
def func():
    str1 = input()
    str2 = input()

    length = len(str1)
    short = str1
    long = str2

    if len(str2) < length:  # 找到短的子串
        length = len(str2)
        short = str2
        long = str1

    max = 0
    for i in range(length,0,-1):
        for j in range(length - i + 1):
            if long.find(short[j:i+j]) != -1:  # 判断在长的子串里有没有短的子串
                max = i
                print(max)
                sys.exit()
    print(max)

try:
    while True:
        func()
except EOFError:
    pass